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]
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.
I do not undertand the problem. If you provide the fibonacci sequence, there is nothing to do.
443 Solvers
Find the largest value in the 3D matrix
838 Solvers
444 Solvers
268 Solvers
186 Solvers