|
Search: id:A123466
|
|
|
| A123466 |
|
Write the positive integer n in binary. Subdivide the binary n into runs each consisting entirely of 0s or of 1's, where the runs alternate between those of 1s and those of 0s. The sequence gives those numbers n such that there is at least one run of 1s of the same length as at least one run of 0s. |
|
+0
1
|
|
| 2, 5, 10, 11, 12, 13, 18, 19, 20, 21, 22, 23, 25, 26, 29
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
25 written in binary is 11001. The runs are (11)(00)(1). Since at least one run of 1's (the leftmost run here) is the same length as at least one run of 0s (the only run of 0s here), 25 is included in this sequence.
|
|
CROSSREFS
|
Adjacent sequences: A123463 A123464 A123465 this_sequence A123467 A123468 A123469
Sequence in context: A097378 A078310 A138848 this_sequence A140707 A136817 A140180
|
|
KEYWORD
|
base,more,nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Jul 11 2008
|
|
|
Search completed in 0.002 seconds
|
