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
-
2499 Solvers
-
Create an n-by-n null matrix and fill with ones certain positions
648 Solvers
-
ベクトル [1 2 3 4 5 6 7 8 9 10] の作成
569 Solvers
-
516 Solvers
-
5132 Solvers
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!