login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

A064369
Smallest integer in Recamán's sequence (A005132) to appear n times.
1
0, 42, 261, 490, 494, 5447, 10023, 18519, 33543, 34292, 62263, 62267, 113405, 113406, 199251, 199252, 199504, 2060609, 2060610, 2060612, 2060614, 2060616, 2060617, 2060618, 2060701, 11526662, 11526664, 11526665, 11526667, 11526670, 11526840, 11526842, 11526845, 11526855, 20389507
OFFSET
1,2
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 A309925
KEYWORD
nice,nonn
AUTHOR
Robert G. Wilson v, Sep 26 2001
EXTENSIONS
a(15)-a(35) by Jud McCranie, Dec 21 2019
STATUS
approved

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy