MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi test

Learn moreOpportunities for recent engineering grads.

Apply TodayGiven the Fibonacci sequence defined by the following recursive relation,

- F_n = F_(n-1) + F_(n-2)
- where F_0 = 0 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

60 correct solutions
22 incorrect solutions

Last solution submitted on Sep 27, 2015

1 player likes this problem