The sequence
0, 1, 1, 4, 9, 25, 64, 169, ...
represents the square of the sequence of Fibonacci numbers.
Let n represent the number of elements to display and let y represent the sequence of squares of Fibonacci numbers.
Example
n = 4 y = [0 1 1 4]
Solution Stats
Problem Comments
3 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers204
Suggested Problems
-
Select every other element of a vector
36595 Solvers
-
Find the longest sequence of 1's in a binary sequence.
6753 Solvers
-
1234 Solvers
-
Sum the numbers on the main diagonal
616 Solvers
-
611 Solvers
More from this Author8
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
you must decide how the input variable is named: 'n', 'nx' or 'x'!! :-/
I cleaned things up a little.
Hard-coded solutions based on look-up tables for F_n or (F_n)², such as Solution 1506329, should be banned and failed by the Test Suite.