Problem 1946. Fibonacci-Sum of Squares
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
Show
1 older comment
Yingcong Zhou
on 24 Dec 2017
There is a typo in the question. F_0 = 0 should be F_0 = 1 otherwise the tests will not be passed.
Maryam HCTRAK Yousef
on 14 Aug 2020
It shows me wrong!
Siddhesh
on 18 Apr 2025
This helps me
Solution Comments
Show commentsProblem Recent Solvers1502
Suggested Problems
-
Maximum running product for a string of numbers
2213 Solvers
-
Find common elements in matrix rows
2680 Solvers
-
579 Solvers
-
Given a window, how many subsets of a vector sum positive
859 Solvers
-
find the maximum element of the matrix
518 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!