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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026366 a(n) = a(m) if a(m) has already occurred exactly once and n = a(m)+2m, else a(n) = least positive integer that has not yet occurred. 5
1, 2, 1, 3, 4, 2, 5, 6, 7, 8, 3, 9, 10, 4, 11, 12, 13, 14, 5, 15, 16, 6, 17, 18, 7, 19, 20, 8, 21, 22, 23, 24, 9, 25, 26, 10, 27, 28, 29, 30, 11, 31, 32, 12, 33, 34, 13, 35, 36, 14, 37, 38, 39, 40, 15, 41, 42, 16, 43, 44, 45, 46, 17, 47, 48, 18, 49 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

A. S. Fraenkel, Heap games, numeration systems and sequences

CROSSREFS

Cf. A045671.

Sequence in context: A166711 A026249 A130527 * A122164 A076632 A105646

Adjacent sequences:  A026363 A026364 A026365 * A026367 A026368 A026369

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

EXTENSIONS

Description corrected by Aviezri Fraenkel (fraenkel(AT)cs.curtin.edu.au)

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

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

Last modified February 16 21:51 EST 2012. Contains 205978 sequences.