|
Search: id:A126387
|
|
|
| A126387 |
|
Read binary expansion of n from the left; keep track of the excess of 1's over 0's that have been seen so far; sequence gives maximum(excess of 1's over 0's). |
|
+0
2
|
|
| 0, 1, 1, 2, 1, 1, 2, 3, 1, 1, 1, 2, 2, 2, 3, 4, 1, 1, 1, 1, 1, 1, 2, 3, 2, 2, 2, 3, 3, 3, 4, 5, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 2, 3, 4, 2, 2, 2, 2, 2, 2, 3, 4, 3, 3, 3, 4, 4, 4, 5, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 2, 3, 2, 2, 2, 3, 3, 3, 4, 5, 2, 2, 2, 2, 2, 2, 2, 3, 2
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
FORMULA
|
a(0) = 0, a(2^i) = 1, if n = 2^i + 2^j + m with j < i and 0 <= m < 2^j, then a(n) = max(a(2^j+m) + j + 2 - i, 1).
|
|
EXAMPLE
|
59 in binary is 111011, excess from left to right is 1,2,3,2,3,4, maximum is 4, so a(59) = 4.
|
|
CROSSREFS
|
Cf. A036989.
Sequence in context: A144790 A090996 A089309 this_sequence A038374 A161161 A136277
Adjacent sequences: A126384 A126385 A126386 this_sequence A126388 A126389 A126390
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Dec 26 2006
|
|
|
Search completed in 0.002 seconds
|
