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
Solve

Solution Stats

47.39% Correct | 52.61% Incorrect
Last Solution submitted on Nov 09, 2025

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers1536

Suggested Problems

Problem Tags

fibonacci sum of squares

Community Treasure Hunt

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

Start Hunting!