A179091 - OEIS

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

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

Other ways to Give

A179091

Variant of Sylvester's sequence: a(n + 1) = a(n)^2 - a(n) + 1, with a(1) = 15

15, 211, 44311, 1963420411, 3855019708367988511, 14861176951905611184725545411860008611, 220854580395850552531842289089175529937535309395681309187277137641134140711

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

The next term -- a(8) -- has 149 digits. [From Harvey P. Dale, Mar 14 2012]

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

Markus Tervooren, Factorizations of Silvester/Euclid sequence 15

MATHEMATICA

NestList[#^2-#+1&, 15, 7] (* Harvey P. Dale, Mar 14 2012 *)

CROSSREFS

Cf. A144779, A144780, A144781, A144782, A144783, A144784, A144785

Sequence in context: A113362 A252875 A135519 * A201340 A051826 A351515

Adjacent sequences: A179088 A179089 A179090 * A179092 A179093 A179094

KEYWORD

nonn

AUTHOR

Ivan Panchenko, Jun 29 2010

STATUS

approved