Given the Fibonacci sequence defined by the following recursive relation,
- F(n) = F(n-1) + F(n-2)
- where F(1) = 1 and F(1) = 1
determine the sum of squares for the first "n" terms.
For example, n=5 --> 1^2 + 1^2 + 2^2 + 3^2 + 5^2 = 40.
- INPUT n=5
- OUTPUT S=40
Solution Stats
Problem Comments
4 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers1713
Suggested Problems
-
1615 Solvers
-
Remove element(s) from cell array
1988 Solvers
-
705 Solvers
-
Flip the vector from right to left
10802 Solvers
-
1848 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Additional test cases have been added.
There is a typo in the question. F_0 = 0 should be F_0 = 1 otherwise the tests will not be passed.
It shows me wrong!
This helps me