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.

Showing 1-1 of 1 results.

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

Original entry on oeis.org

18, 307, 93943, 8825193307, 77884036897092402943, 6065923203387650816975131277148782658307, 36795424309396699379852983331957135547989414580911143782409880284213748733447943
Offset: 1

Views

Author

Ivan Panchenko, Jun 30 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

Showing 1-1 of 1 results.