login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A144747 Recurrence sequence a(n)=a(n-1)^2-a(n-1)-1, a(0)=7. 5
7, 41, 1639, 2684681, 7207509387079, 51948191564824694742765161, 2698614606855723567054656642857156538246857652590759, 7282520796335071470236496456671241855257664867148949932302276253455702665493855273950765616767079605321 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
a(0)=3 is the smallest integer generating an increasing sequence of the form a(n)=a(n-1)^2-a(n-1)-1, cf. A144743.
LINKS
FORMULA
a(n)=a(n-1)^2-a(n-1)-1 and a(0)=7.
a(n) ~ c^(2^n), where c = 6.3622623884585267364822329679498420997632627444610172910703030892754... . - Vaclav Kotesovec, May 06 2015
MATHEMATICA
a = {}; k = 7; Do[k = k^2 - k - 1; AppendTo[a, k], {n, 1, 10}]; a
PROG
(PARI) a(n, s=7)={for(i=1, n, s=s^2-s-1); s} \\ M. F. Hasler, Oct 06 2014
CROSSREFS
Sequence in context: A053676 A002701 A057006 * A176090 A183064 A290045
KEYWORD
nonn
AUTHOR
Artur Jasinski, Sep 20 2008
EXTENSIONS
Edited by M. F. Hasler, Oct 06 2014
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)