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.

A064228 From Recamán's sequence (A005132): values of n achieving records in A057167.

Original entry on oeis.org

0, 1, 2, 4, 19, 61, 879, 1355, 2406
Offset: 1

Views

Author

N. J. A. Sloane, Sep 22 2001

Keywords

Comments

If R(n) is the n-th term of Recamán's sequence (A005132), sequence gives values of R(n) that take a record number of steps to appear. A064227 gives corresponding values of n.

Crossrefs

Extensions

a(8) and a(9) from Allan Wilks, Nov 06 2001. After 10^15 terms of A005132, the smallest missing number was 852655.
After 10^25 terms of A005132 the smallest missing number is still 852655. - Benjamin Chaffin, Jun 13 2006
Even after 4.28*10^73 terms, the smallest missing number is still 852655. - Benjamin Chaffin, Mar 22 2010
Even after 10^230 terms, the smallest missing number is still 852655. - Benjamin Chaffin, 2018
Initial term 0 added by N. J. A. Sloane, Feb 26 2023