a(1) = 0
a(2) = 1
a(2*N) = sqrt(a(2*N-1)*a(2*N+1))
a(2*N+1) = (a(2*N)+a(2*N+2))/2
given n return a(n)
The two recursion equations are mixed up.
It dseon't mettar waht oedrr the lrettes in a wrod are.
Reverse the vector
Project Euler: Problem 8, Find largest product in a large string of numbers
Fill a zeros matrix
Pancakes for everyone!
Disappear in 3, 2, 1 ...
Polite numbers. Politeness.
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
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