|
Search: id:A113504
|
|
|
| A113504 |
|
a(0) = 1. For n >= 1, a(n) = number of earlier terms of the sequence that have the same number of ones in their binary representations as n. |
|
+0
5
|
|
| 1, 1, 2, 0, 3, 1, 1, 0, 5, 2, 2, 0, 2, 0, 0, 0, 8, 2, 2, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 13, 2, 2, 1, 2, 1, 1, 0, 2, 1, 1, 0, 1, 0, 0, 0, 2, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 28, 2, 2, 2, 2, 2, 2, 0, 2, 2, 2, 0, 2, 0, 0, 0, 2, 2, 2, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 2, 2, 0, 2, 0, 0, 0, 2
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
A115211(n) = A00120(a(n)) = number of ones in binary representation of a(n) for n>0; record values: A115212(n) = a(A115213(n)). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 17 2006
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
EXAMPLE
|
The first 8 terms (terms 0 through 7) written in binary are [1,1,10,0,11,1,1,0]. Term 8 gives the number of earlier terms with the same number of 1's in their binary representation as 8 (which is 1000 in binary, for one 1). a(8) = 5 because there are five terms among the earlier terms with one binary 1 (terms with one 1: 1, 1, 2, 1 and 1).
|
|
CROSSREFS
|
Cf. A113503, A000120.
Adjacent sequences: A113501 A113502 A113503 this_sequence A113505 A113506 A113507
Sequence in context: A144955 A002187 A124756 this_sequence A124754 A047983 A070812
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet, Jan 10 2006
|
|
EXTENSIONS
|
More terms from Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 17 2006
|
|
|
Search completed in 0.002 seconds
|
