[go: up one dir, main page]

login
A144793
Consider the runs of 0's in the binary representation of n, each of these runs being on the edge of the binary representation n and/or being bounded by 1's. Consider also the runs of 1's in the binary representation of n, each of these runs being on the edge of the binary representation n and/or being bounded by 0's. A positive integer n is included in this sequence if the length of the shortest such run of 0's in binary n equals the length of the shortest such run of 1's in binary n.
0
2, 5, 10, 11, 12, 13, 18, 20, 21, 22, 23, 26, 29, 34, 37, 38, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 53, 56, 58, 61, 66, 69, 70, 74, 75, 77, 78, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 98, 101, 103, 104, 105, 106, 107, 109, 114, 115, 116, 117
OFFSET
1,1
COMMENTS
This sequence contains those positive integers m where A144789(m) = A144790(m).
EXAMPLE
1564 in binary is 11000011100. The runs of 0's are like this: 11(0000)111(00). The runs of 1's are like this: (11)0000(111)00. The shortest run of 0's contains two 0's. The shortest run of 1's contains two 1's. Since both the shortest run of 0's and the shortest run of 1's are of the same length, 1564 is included in this sequence.
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Leroy Quet, Sep 21 2008, Oct 07 2008
EXTENSIONS
Extended by Ray Chandler, Nov 04 2008
STATUS
approved