login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A184163
a(0)=1, a(1)=1, a(n)=a(n-1)^a(n-2)+1.
4
1, 1, 2, 3, 10, 1001, 1010045120210252210120045010002
OFFSET
0,3
COMMENTS
a(7) has over 30000 digits.
FORMULA
a(n)=a(n-1)^a(n-2)+1
EXAMPLE
a(5)=a(4)^a(3)+1=(a(3)^a(2)+1)^(a(2)^a(1)+1)+1=((a(2)^a(1)+1)^(a(1)^a(0)+1)+1)^((a(1)^a(0)+1)+1)+1=(((a(1)^a(0)+1)+1)^(1+1)+1)^((1+1)+1)+1=(((1+1)+1)^2+1)^3+1=1001.
PROG
(Maxima)
a[0]:1$
a[1]:1$
a[n]:=a[n-1]^a[n-2]+1;
makelist(a[n], n, 1, 10); /* Martin Ettl, Oct 29 2012 */
CROSSREFS
KEYWORD
nonn
AUTHOR
Nico Brown, Oct 24 2012
STATUS
approved