Fibonacci-Sum of Squares - MATLAB Cody - MATLAB Central

Problem 1946. Fibonacci-Sum of Squares

Difficulty:
(31)
Rate

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.27% Correct | 52.73% Incorrect
Last Solution submitted on Oct 30, 2025

Problem Comments

Solution Comments

Show comments
Join Cody Contest 2025 — Have Fun and Win Prizes!
...
We’re excited to invite you to Cody Contest 2025! 🎉 Pick a team,...
Dive Into Hands-On Learning at MATLAB EXPO 2025 – Register Now!
Get ready to roll up your sleeves at MATLAB EXPO 2025 –...
Devin in MATLAB EXPO
0
View Post

Problem Recent Solvers1523

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!