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.

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

Original entry on oeis.org

17, 273, 74257, 5514027793, 30404502496462423057, 924433772057389715967338233131182802193, 854577798920253967214683802805361134256432824758816469437971879296076582807057
Offset: 1

Views

Author

Ivan Panchenko, Jun 29 2010

Keywords

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&,17,10] (* Harvey P. Dale, Aug 16 2012 *)