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
Solve

Solution Stats

3856 Solutions

1721 Solvers

Last Solution submitted on Apr 20, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers1721

Pierre Croquette Tessa O'Reilly Lorenzo Mackenzie Martin

Suggested Problems

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!