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

Offset: 1

Author

Ivan Panchenko, Jun 29 2010

Keywords

• nonn
• changed

Comments

The next term a(8) has 149 digits. - 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

• Markus Tervooren, Factorizations of Silvester/Euclid sequence 15

Crossrefs

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

Programs

Mathematica

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