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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064369 Smallest integer in Recamán's sequence (A005132) to appear n times. 0
42, 261, 490, 494, 5447, 10023, 18519, 33543, 34292, 62263, 62267, 113405, 113406 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

Index entries for sequences related to Recamán's sequence

MATHEMATICA

a = {1}; Do[ If[ a[ [ -1 ] ] - n > 0 && Position[ a, a[ [ -1 ] ] - n ] == {}, a = Append[ a, a[ [ -1 ] ] - n ], a = Append[ a, a[ [ -1 ] ] + n ] ], {n, 2, 10^5} ]; b = Sort[ a ]; Do[ k = 1; While[ b[ [ k ] ] != b[ [ k + n ] ], k++ ]; Print[ b[ [ k ] ] ], {n, 1, 13} ]

CROSSREFS

Cf. A005132.

Sequence in context: A299717 A156357 A300338 * A234043 A323800 A188058

Adjacent sequences:  A064366 A064367 A064368 * A064370 A064371 A064372

KEYWORD

easy,nice,nonn

AUTHOR

Robert G. Wilson v, Sep 26 2001

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 22 04:04 EDT 2019. Contains 322329 sequences. (Running on oeis4.)