|
| |
|
|
A100922
|
|
n appears A000120(n) times (appearances equal number of 1-bits).
|
|
1
| |
|
|
1, 2, 3, 3, 4, 5, 5, 6, 6, 7, 7, 7, 8, 9, 9, 10, 10, 11, 11, 11, 12, 12, 13, 13, 13, 14, 14, 14, 15, 15, 15, 15, 16, 17, 17, 18, 18, 19, 19, 19, 20, 20, 21, 21, 21, 22, 22, 22, 23, 23, 23, 23, 24, 24, 25, 25, 25, 26, 26, 26, 27, 27, 27, 27, 28, 28, 28, 29, 29, 29, 29, 30, 30, 30
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| Clearly every positive integer appears at least once in this sequence.
|
|
|
EXAMPLE
| The binary representation of 16 is 10000, which has one 1-bit (and four 0-bits), hence 16 appears once in this sequence (and four times in A100921).
|
|
|
CROSSREFS
| Cf. A100921 (n's appearances equal its number of 0-bits), A030530 (n's appearances equal its total number of bits).
Sequence in context: A166493 A005185 A119466 * A047785 A027923 A167743
Adjacent sequences: A100919 A100920 A100921 * A100923 A100924 A100925
|
|
|
KEYWORD
| base,easy,nonn
|
|
|
AUTHOR
| Rick L. Shepherd (rshepherd2(AT)hotmail.com), Nov 21 2004
|
| |
|
|
