login
This site is supported by donations to The OEIS Foundation.

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064228 From Recamán's sequence (A005132): values of n achieving records in A057167. 10
1, 2, 4, 19, 61, 879, 1355, 2406 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

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.

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

CROSSREFS

Cf. A005132, A057167, A064227.

Sequence in context: A018273 A047092 A229485 * A226891 A168246 A212923

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 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

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified September 19 09:42 EDT 2014. Contains 246975 sequences.