Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A144743
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A144743 Recurence sequence a(n)=a(n-1)^2-a(n-1)-1 a(0)=3 +0
7
5, 19, 341, 115939, 13441735781, 180680260792773944179, 32645356640144805339284259388335434039861, 10657193101622465334886426687272422298361484904410051135243017426658451355028594\ 59 (list; graph; listen)
OFFSET

1,1

COMMENT

a(0)=3 is the smallest integer generating decreasing sequence of the form a(n)=a(n-1)^2-a(n-1)-1

FORMULA

a(n)=a(n-1)^2-a(n-1)-1

MATHEMATICA

a = {}; k = 3; Do[k = k^2 - k - 1; AppendTo[a, k], {n, 1, 10}]; a

CROSSREFS

A000058, A082732, A144744, A144745, A144746, A144747, A144748

Sequence in context: A092751 A122150 A092663 this_sequence A072526 A095218 A119964

Adjacent sequences: A144740 A144741 A144742 this_sequence A144744 A144745 A144746

KEYWORD

nonn

AUTHOR

Artur Jasinski (grafix(AT)csl.pl), Sep 20 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 5 23:38 EST 2009. Contains 170428 sequences.


AT&T Labs Research