Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A144779
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A144779 Variant of Sylvester's sequence: a(n+1) = a(n)^2 - a(n) + 1, with a(1) = 5 +0
12
5, 21, 421, 176821, 31265489221, 977530816197201697621, 955566496615167328821993756200407115362021, 91310732945338459409065560514258959194455689190167413834371607297572219308277384\ 2421 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n) =2.12799590746410705457735194814049878380944092755462023387761440825397916796276349223231^(2^n) a(n+1) = a(n)^2 - a(n) + 1, with a(1) = 5

MATHEMATICA

a = {}; k = 5; Do[AppendTo[a, k]; k = k^2 - k + 1, {n, 1, 10}]; a or Table[Round[2.127995907464107054577351948140498783809440927554620233877614408253\ 97916796276349223231^(2^n)], {n, 1, 8}] (*Artur Jasinski*)

CROSSREFS

A000058, A082732, A144779, A144781, A144781, A144782, A144783, A144784, A144785, A144786, A144787, A144788

Sequence in context: A009732 A009758 A143503 this_sequence A156860 A063619 A045015

Adjacent sequences: A144776 A144777 A144778 this_sequence A144780 A144781 A144782

KEYWORD

nonn

AUTHOR

Artur Jasinski (grafix(AT)csl.pl), Sep 21 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research