Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064369
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A064369 Smallest integer in Recaman's sequence (A005132) to appear n times. +0
1
42, 261, 490, 494, 5447, 10023, 18519, 33543, 34292, 62263, 62267, 113405, 113406 (list; graph; listen)
OFFSET

1,1

LINKS

Index entries for sequences related to Recaman'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: A122242 A046655 A156357 this_sequence A036463 A167654 A095266

Adjacent sequences: A064366 A064367 A064368 this_sequence A064370 A064371 A064372

KEYWORD

easy,nice,nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Sep 26 2001

page 1

Search completed in 0.120 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research