|
Search: id:A049501
|
|
|
| A049501 |
|
Major index of n, first definition. |
|
+0
2
|
|
| 0, 0, 1, 0, 1, 1, 2, 0, 1, 1, 4, 1, 2, 2, 3, 0, 1, 1, 5, 1, 4, 4, 5, 1, 2, 2, 6, 2, 3, 3, 4, 0, 1, 1, 6, 1, 5, 5, 6, 1, 4, 4, 9, 4, 5, 5, 6, 1, 2, 2, 7, 2, 6, 6, 7, 2, 3, 3, 8, 3, 4, 4, 5, 0, 1, 1, 7, 1, 6, 6, 7, 1, 5, 5, 11, 5, 6, 6, 7, 1, 4, 4, 10, 4, 9, 9, 10, 4, 5, 5, 11, 5, 6, 6, 7, 1, 2, 2, 8, 2, 7, 7, 8
(list; graph; listen)
|
|
|
OFFSET
|
0,7
|
|
|
REFERENCES
|
D. M. Bressoud, Proofs and Confirmations, Camb. Univ. Press, 1999; cf. p. 89.
|
|
FORMULA
|
Write n in binary; sum the positions where there is a '1' followed immediately to the right by a '0', counting the leftmost digit as position '1'.
|
|
EXAMPLE
|
50 = 110010 has 1's followed by 0's in positions 2 and 5 (reading from the left), so a(50)=7. At the beginning of the sequence we have 0->0, 1->0, 10->1, 11->0, 100->1, 101->1, 110->2, 111->0, 1000->1, 1001->1, 1010->1+3=4, ...
|
|
CROSSREFS
|
Cf. A049502.
Sequence in context: A124220 A110298 A144740 this_sequence A102564 A077762 A085496
Adjacent sequences: A049498 A049499 A049500 this_sequence A049502 A049503 A049504
|
|
KEYWORD
|
nonn,base,nice,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Erich Friedman (efriedma(AT)stetson.edu), Feb 19 2000
|
|
|
Search completed in 0.002 seconds
|
