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

45.26% Correct | 54.74% Incorrect
Last Solution submitted on Feb 29, 2024

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers1251

Suggested Problems

Problem Tags

Community Treasure Hunt

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

Start Hunting!