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 all elements less than 0 or greater than 10 and replace them with NaN
Sum all integers from 1 to 2^n
Sum the Infinite Series
Generate a random matrix A of (1,-1)
Find nth maximum
Polite numbers. Politeness.
Polite numbers. N-th polite number.
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