A344165 a(n) = number of runs in n-th word in A342910.

1, 1, 1, 2, 2, 1, 2, 1, 3, 1, 2, 2, 2, 3, 3, 1, 2, 3, 2, 2, 2, 4, 3, 3, 1, 1, 3, 3, 4, 2, 3, 2, 2, 4, 2, 4, 3, 3, 1, 2, 3, 3, 3, 3, 5, 2, 4, 3, 3, 2, 2, 4, 2, 3, 4, 4, 3, 4, 3, 1, 2, 2, 4, 3, 3, 3, 4, 5, 5, 2, 3, 5, 3, 4, 3, 3, 2, 2, 4, 1, 3, 3, 4, 4, 5, 4

Offset

1,4

Links

Table of n, a(n) for n=1..86.

Example

The first 20 words in A342910: 0, 1, 00, 01, 10, 000, 001, 11, 010, 0000, 100, 0001, 011, 101, 0010, 00000, 110, 0100, 00001, 1000; so a(9) = 3, the runs being 0, 1, and 9..

Mathematica

(See A342910.)

Crossrefs

Cf. A342910, A342789.

Sequence in context: A000924 A306911 A348406 * A305432 A305298 A298824

Adjacent sequences: A344162 A344163 A344164 * A344166 A344167 A344168

Keyword

nonn,base

Author

Clark Kimberling, Jun 03 2021

Status

approved