|
Search: id:A073015
|
|
|
| A073015 |
|
a(n) is such that 2 = sqrt(1+sqrt(1+sqrt(1+....sqrt(a(n))....))) where there are n sqrt's. |
|
+0
1
|
|
| 3, 4, 9, 64, 3969, 15745024, 247905749270529, 61457260521381894004129398784, 3776994870793005510047522464634252677140721938309041881089, 14265690253996672387291309349232388828298289458234016200317876247121873778287073518355813134107244701354409532063744
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
REFERENCES
|
Berndt and Rankin, "Ramanujan, letters and commentary", p. 275
Bruce Berndt, "Ramanujan's notebook", part II, Springer Verlag, pp. 107-112
|
|
FORMULA
|
a(n)=A003096(n)+1
|
|
EXAMPLE
|
2 = sqrt(1+sqrt(1+sqrt(64))) hence a(3)=64
|
|
PROGRAM
|
(PARI) a(n)=if(n<1, 3*(n==0), (a(n-1)-1)^2)
|
|
CROSSREFS
|
Cf. A003096.
Sequence in context: A084715 A015240 A032477 this_sequence A063930 A014411 A139556
Adjacent sequences: A073012 A073013 A073014 this_sequence A073016 A073017 A073018
|
|
KEYWORD
|
easy,nice,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 03 2002
|
|
|
Search completed in 0.002 seconds
|
