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”).

A144745
Recurrence sequence a(n)=a(n-1)^2-a(n-1)-1, a(0)=9.
5
9, 71, 4969, 24685991, 609398126966089, 371366077149776919833628989831, 137912763257614063309949706968500684963726537144819872418729
OFFSET
0,1
COMMENTS
The original version of this sequence had a(0)=5=A144743(1) and therefore was essentially the same as that sequence A144743.
The next term a(8) has 119 digits.
FORMULA
a(n) = a(n-1)^2-a(n-1)-1 and a(0)=9.
a(n) ~ c^(2^n), where c = 8.395688554881795978328174160925857176207363473280394010762212170489... . - Vaclav Kotesovec, May 06 2015
MATHEMATICA
k = 9; a = {k}; Do[k = k^2 - k - 1; AppendTo[a, k], {n, 1, 10}]; a
NestList[#^2 - # - 1 &, 9, 7] (* Harvey P. Dale, Feb 04 2011 *)
PROG
(PARI) a(n, s=9)=for(i=1, n, s=s^2-s-1); s \\ M. F. Hasler, Oct 06 2014
KEYWORD
nonn
AUTHOR
Artur Jasinski, Sep 20 2008
EXTENSIONS
New initial value a(0)=9 from M. F. Hasler, Oct 20 2014
STATUS
approved