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.
Sort a list of complex numbers based on far they are from the origin.
3609 Solvers
1676 Solvers
How to find the position of an element in a vector without using the find function
2254 Solvers
find the roots of a quadratic equation
119 Solvers
359 Solvers