1,2

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.

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

Cf. A005132, A057167, A064227.

Sequence in context: A131578 A018273 A047092 this_sequence A058130 A046082 A048774

Adjacent sequences: A064225 A064226 A064227 this_sequence A064229 A064230 A064231

nonn,nice,hard

N. J. A. Sloane (njas(AT)research.att.com), Sep 22 2001

a(7) and a(8) from Allan Wilks (allan(AT)research.att.com), 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 (chaffin(AT)gmail.com), Jun 13 2006