|
Search: id:A064227
|
|
| |
|
| 1, 4, 131, 99734, 181653, 328002, 325374625245, 394178473633984
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Let R(n) = n-th term of Recaman's sequence (A005132); consider values of R(n) that take a record number of steps to appear (A064228); sequence gives corresponding values of n.
|
|
LINKS
|
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, A064228.
Sequence in context: A006103 A003371 A113253 this_sequence A146547 A045482 A006429
Adjacent sequences: A064224 A064225 A064226 this_sequence A064228 A064229 A064230
|
|
KEYWORD
|
nonn,nice,hard
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Sep 22 2001
|
|
EXTENSIONS
|
a(7) and a(8) from Allan Wilks (allan(AT)research.att.com), Nov 06, 2001
a(9) > 10^25. - Benjamin Chaffin (chaffin(AT)gmail.com), Jun 13 2006
|
|
|
Search completed in 0.002 seconds
|
