|
| |
|
|
A064228
|
|
From Recaman's sequence (A005132): values of n achieving records in A057167.
|
|
10
|
| |
|
|
|
OFFSET
|
1,2
|
|
|
COMMENTS
|
If R(n) is the n-th term of Recaman's sequence (A005132), sequence gives values of R(n) that take a record number of steps to appear. A064227 gives corresponding values of n.
|
|
|
LINKS
|
Table of n, a(n) for n=1..8.
N. J. A. Sloane, My favorite integer sequences, in Sequences and their Applications (Proceedings of SETA '98).
N. J. A. Sloane, FORTRAN program for A005132, A057167, A064227, A064228
Index entries for sequences related to Recaman's sequence
|
|
|
CROSSREFS
|
Cf. A005132, A057167, A064227.
Sequence in context: A131578 A018273 A047092 * A168246 A212923 A058130
Adjacent sequences: A064225 A064226 A064227 * A064229 A064230 A064231
|
|
|
KEYWORD
|
nonn,nice,hard
|
|
|
AUTHOR
|
N. J. A. Sloane, Sep 22 2001
|
|
|
EXTENSIONS
|
a(7) and a(8) from _Allan Wilks_, Nov 06, 2001. After 10^15 terms of A005132 the smallest missing number is 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
|
|
|
STATUS
|
approved
|
| |
|
|
