login
A092500
a(0)=0; for n>0, a(n) = a(n-1)^2 + 10.
1
0, 10, 110, 12110, 146652110, 21506841367452110, 462544225604749344790073143452110, 213947160640297259376086109686762856183078407835978386567863452110
OFFSET
0,2
REFERENCES
Seen in a book of childrens' puzzles.
LINKS
A. V. Aho and N. J. A. Sloane, Some doubly exponential sequences, Fibonacci Quarterly, Vol. 11, No. 4 (1973), pp. 429-437, alternative link.
FORMULA
a(n) ~ c^(2^n), where c = 3.238866292437990085943388592812059704313575654180076939634689321634968834... . - Vaclav Kotesovec, Dec 17 2014
MATHEMATICA
RecurrenceTable[{a[0]==0, a[n]==a[n-1]^2 + 10}, a, {n, 0, 10}] (* Vaclav Kotesovec, Dec 17 2014 *)
CROSSREFS
Sequence in context: A339713 A020767 A036603 * A092501 A266926 A209234
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Apr 07 2004
STATUS
approved