A064227 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A064227

From Recamán's sequence (A005132): record values in A057167.

0, 1, 4, 131, 99734, 181653, 328002, 325374625245, 394178473633984

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

COMMENTS

Let R(n) = n-th term of Recamán'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

Table of n, a(n) for n=1..9.

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 Recamán's sequence

CROSSREFS

Cf. A005132, A057167, A064228.

Sequence in context: A201977 A291172 A194536 * A353794 A204079 A252172

Adjacent sequences: A064224 A064225 A064226 * A064228 A064229 A064230

KEYWORD

nonn,nice,hard,more

AUTHOR