|
Search: id:A109451
|
|
|
| A109451 |
|
a(1)=1; a(n) = smallest positive integer not already present such that a(n-1) and a(n) have a different number of 1's in their binary expansions. |
|
+0
1
|
|
| 1, 3, 2, 5, 4, 6, 7, 8, 9, 11, 10, 13, 12, 14, 15, 16, 17, 19, 18, 21, 20, 22, 23, 24, 25, 27, 26, 29, 28, 30, 31, 32, 33, 35, 34, 37, 36, 38, 39, 40, 41, 43, 42, 45, 44, 46, 47, 48, 49, 51, 50, 53, 52, 54, 55, 56, 57, 59, 58, 61, 60, 62, 63, 64, 65, 67, 66, 69, 68, 70, 71, 72
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
This sequence is a permutation of the positive integers.
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
EXAMPLE
|
Among the positive integers (10, 11,12, 13,...) not among the first 9 terms of the sequence, 10 (decimal) has 2 1's in its binary form (1010), the same number of 1's as 9 in binary (1001). 11 (decimal), however, has 3 ones in its binary form (1011), so a(10) = 11.
|
|
CROSSREFS
|
Sequence in context: A109712 A095049 A118209 this_sequence A160017 A117303 A054068
Adjacent sequences: A109448 A109449 A109450 this_sequence A109452 A109453 A109454
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet Aug 27 2005
|
|
EXTENSIONS
|
Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Aug 27 2005
|
|
|
Search completed in 0.002 seconds
|
