login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A212439 a(n) = 2*n + A181935(n) mod 2. 4
1, 3, 5, 6, 8, 11, 13, 15, 17, 19, 20, 22, 24, 27, 29, 30, 32, 35, 37, 38, 40, 42, 45, 47, 49, 51, 52, 54, 56, 59, 61, 63, 65, 67, 69, 70, 72, 74, 77, 79, 81, 83, 85, 86, 88, 90, 93, 94, 96, 99, 101, 102, 104, 106, 108, 111, 113, 115, 116, 118, 120, 123, 125 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
a(n) = 2*n + A212412(n): concatenation of binary representation of n and the parity of its curling number;
A212444 gives iterations starting from 0.
LINKS
Benjamin Chaffin and N. J. A. Sloane, The Curling Number Conjecture, preprint.
PROG
(Haskell)
a212439 n = 2 * n + a212412 n
CROSSREFS
Sequence in context: A047444 A279933 A327206 * A160734 A121501 A327218
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, May 17 2012
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 06:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)