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.
Find the sum of all the numbers of the input vector
The Tower of Hanoi
Find the largest value in the 3D matrix
Count up then down
Avalaible area: wall construction
Which permutation is it?
Polite numbers. Politeness.
Polite numbers. N-th polite number.
Have you solved this problem?
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