Write a recursive method in Java to calculate the following function: f(n) = 12 + 22 + 32 + … + n2 Defined recursively, this is: f(n) = 1 if n = 1 n2 + f(n-1) if n > 1
Sun | Mon | Tue | Wed | Thu | Fri | Sat |
---|---|---|---|---|---|---|
29 | 30 | 1 | 2 | 3 | 4 | 5 |
6 | 7 | 8 | 9 | 10 | 11 | 12 |
13 | 14 | 15 | 16 | 17 | 18 | 19 |
20 | 21 | 22 | 23 | 24 | 25 | 26 |
27 | 28 | 29 | 30 | 31 | 1 | 2 |