login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A144781 Variant of Sylvester's sequence: a(n+1) = a(n)^2 - a(n) + 1, with a(1) = 8 15
8, 57, 3193, 10192057, 103878015699193, 10790642145601683494645152057, 116437957914435303575899742229333045108448631998006179193, 13557798043283806950297045269968250387897834581711367551819275131055206893868524458302302046950954641412419952057 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

REFERENCES

Mohammad K. Azarian, Sylvester's Sequence and the Infinite Egyptian Fraction Decomposition of 1, Problem 958, College Mathematics Journal, Vol. 42, No. 4, September 2011, p. 330.  Solution published in Vol. 43, No. 4, September 2012, pp. 340-342.

LINKS

Table of n, a(n) for n=1..8.

FORMULA

a(n) = A144805^(2^n).

MATHEMATICA

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

CROSSREFS

A000058, A082732, A144779 - A144788

Sequence in context: A208596 A002402 A015464 * A026948 A111585 A055839

Adjacent sequences:  A144778 A144779 A144780 * A144782 A144783 A144784

KEYWORD

nonn

AUTHOR

Artur Jasinski, Sep 21 2008

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 25 05:13 EDT 2013. Contains 225643 sequences.