|
| |
|
|
A346307
|
|
Number of runs in the n-th word in A076478.
|
|
1
|
|
|
|
1, 1, 1, 2, 2, 1, 1, 2, 3, 2, 2, 3, 2, 1, 1, 2, 3, 2, 3, 4, 3, 2, 2, 3, 4, 3, 2, 3, 2, 1, 1, 2, 3, 2, 3, 4, 3, 2, 3, 4, 5, 4, 3, 4, 3, 2, 2, 3, 4, 3, 4, 5, 4, 3, 2, 3, 4, 3, 2, 3, 2, 1, 1, 2, 3, 2, 3, 4, 3, 2, 3, 4, 5, 4, 3, 4, 3, 2, 3, 4, 5, 4, 5, 6, 5, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,4
|
|
|
LINKS
|
Table of n, a(n) for n=1..86.
|
|
|
EXAMPLE
|
The first fourteen words w(n) are 0, 1, 00, 01, 10, 11, 000, 001, 010, 011, 100, 101, 110, 111, so that a(9) = 3.
|
|
|
MATHEMATICA
|
(See A007931.)
|
|
|
CROSSREFS
|
Cf. A007931, A076478.
Sequence in context: A161638 A066030 A025863 * A339352 A305825 A324029
Adjacent sequences: A346304 A346305 A346306 * A346308 A346309 A346310
|
|
|
KEYWORD
|
nonn,base
|
|
|
AUTHOR
|
Clark Kimberling, Aug 16 2021
|
|
|
STATUS
|
approved
|
| |
|
|
