|
Search: id:A133231
|
|
|
| A133231 |
|
Number of distinct numbers that are contained in the length n+1 prefix of the binary Champernowne word. |
|
+0
1
|
|
| 1, 2, 3, 5, 7, 9, 12, 15, 20, 25, 30, 35, 40, 45, 50, 57, 64, 71, 81, 91, 101, 114, 127, 140
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
Index entries for sequences related to binary expansion of n
|
|
EXAMPLE
|
Champernowne word = '01101110 01011....', see A030190:
a(5) = #{0, 1, 10, 11, 101, 110, 1011, 1101, 11011} = 9;
a(6) = a(5) + #{111, 10111, 110111} = 9 + 3 = 12;
a(7) = a(6) + #{1110, 101110, 1101110} = 12 + 3 = 15.
|
|
CROSSREFS
|
Cf. A030190, A055143.
Adjacent sequences: A133228 A133229 A133230 this_sequence A133232 A133233 A133234
Sequence in context: A137285 A062441 A059290 this_sequence A074752 A039825 A126256
|
|
KEYWORD
|
nonn,more,base
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 15 2008
|
|
|
Search completed in 0.002 seconds
|
