login
a(0)=0, a(1)=1, a(2)=10; for n>2, a(n) = a(n-1)^2 + 10.
0

%I #9 Apr 07 2021 02:49:57

%S 0,1,10,110,12110,146652110,21506841367452110,

%T 462544225604749344790073143452110,

%U 213947160640297259376086109686762856183078407835978386567863452110

%N a(0)=0, a(1)=1, a(2)=10; for n>2, a(n) = a(n-1)^2 + 10.

%D Seen in a book of childrens' puzzles.

%H A. V. Aho and N. J. A. Sloane, <a href="https://www.fq.math.ca/Scanned/11-4/aho-a.pdf">Some doubly exponential sequences</a>, Fibonacci Quarterly, Vol. 11, No. 4 (1973), pp. 429-437, <a href="http://neilsloane.com/doc/doubly.html">alternative link</a>.

%H <a href="/index/Aa#AHSL">Index entries for sequences of form a(n+1)=a(n)^2 + ...</a>

%t Join[{0,1},NestList[#^2+10&,10,10]] (* _Harvey P. Dale_, Jan 14 2021 *)

%Y The beginning is ugly. See A092500 for a better version.

%K nonn

%O 0,3

%A _N. J. A. Sloane_, Apr 07 2004