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.
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.
Project Euler: Problem 10, Sum of Primes
Set the array elements whose value is 13 to 0
Dimensions of a rectangle
Deleting an element in a matrix
Concatenate two strings
Find the square of the sum of the digits of a number
Convert a number to its Roman representation
Find the area of the four walls
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office