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.

A339581 Indices of records in A063377.

Original entry on oeis.org

1, 2, 89, 1122659, 19099919, 85864769, 26089808579, 554688278429, 4090932431513069, 95405042230542329
Offset: 1

Views

Author

N. J. A. Sloane, Dec 24 2020

Keywords

Comments

The records themselves begin 0,5,6,7,8,9,10,12,13,14.
a(11) <= 90616211958465842219 = A005602(15). Between a(10) and this upper bound could be another record which might not be listed in A005602.
a(n) == 9 mod 10 for n > 2 (see A063377). - Michael S. Branicky, Dec 24 2020

References

  • Carl Pomerance, Problem 81:21 (= 321), in R. K. Guy link.

Crossrefs

Formula

a(n) = A057331(n + 2) for n >= 2. - David A. Corneth, Dec 25 2020

Extensions

a(6) corrected and a(7) found by David A. Corneth, Dec 24 2020.
a(8)-a(10) were taken from A057331 and the bound on a(11) was taken from A005602. - David A. Corneth and Amiram Eldar, Dec 25 2020