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)
Solution Stats
Problem Comments
-
1 Comment
William
on 8 May 2019
The two recursion equations are mixed up.
Recent Solvers11
Suggested Problems
-
13571 Solvers
-
It dseon't mettar waht oedrr the lrettes in a wrod are.
476 Solvers
-
3682 Solvers
-
Project Euler: Problem 8, Find largest product in a large string of numbers
180 Solvers
-
249 Solvers
More from this Author47
Tags
Select a Web Site
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: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)