|
Search: id:A056062
|
|
|
| A056062 |
|
Run lengths in infinite binary string formed by concatenation of 0, 1, 2 ... in base 2. |
|
+0
3
|
|
| 1, 2, 1, 3, 2, 1, 1, 3, 1, 4, 3, 1, 2, 2, 1, 1, 1, 1, 1, 4, 2, 2, 1, 4, 1, 5, 4, 1, 3, 2, 2, 1, 1, 1, 2, 3, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 5, 3, 2, 2, 3, 1, 1, 1, 2, 1, 5, 2, 3, 1, 5, 1, 6, 5, 1, 4, 2, 3, 1, 1, 1, 3, 3, 2, 1, 2, 1, 2, 1, 1, 2, 2, 2, 1, 1, 2, 4, 1, 1, 3, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
EXAMPLE
|
The string starts with 011011100101110111... (concatenation of 0, 1, 10, 11, 100, 101, 110, 111, ...) so initial runs are 1, 2, 1, 3, ...
|
|
CROSSREFS
|
Cf. A030190.
Cf. A003607, A030306.
Sequence in context: A145327 A023512 A088192 this_sequence A165003 A165011 A064034
Adjacent sequences: A056059 A056060 A056061 this_sequence A056063 A056064 A056065
|
|
KEYWORD
|
easy,nonn,nice
|
|
AUTHOR
|
Helge Robitzsch (hrobi(AT)math.uni-goettingen.de), Jul 27 2000
|
|
|
Search completed in 0.002 seconds
|
