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.

Previous Showing 11-14 of 14 results.

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

Original entry on oeis.org

15, 211, 44311, 1963420411, 3855019708367988511, 14861176951905611184725545411860008611, 220854580395850552531842289089175529937535309395681309187277137641134140711
Offset: 1

Views

Author

Ivan Panchenko, Jun 29 2010

Keywords

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

Crossrefs

Programs

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

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 *)

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 *)

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

Previous Showing 11-14 of 14 results.