cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

16, 241, 57841, 3345523441, 11192527090934957041, 125272662681312932108439098957580518641, 15693240015266013784686188640793618219085803766811358216456462217808967968241
Offset: 1

Views

Author

Ivan Panchenko, Jun 29 2010

Keywords

Comments

The next term (a(8)) has 153 digits. - Harvey P. Dale, May 11 2022

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

Crossrefs

Programs

  • Mathematica
    NestList[#^2-#+1&,16,6] (* Harvey P. Dale, May 11 2022 *)