A344961 a(n) is the number of runs in the n-th word in A344953.

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

Offset

1,4

Comments

Every positive integer occurs infinitely many times.

Links

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

Example

The first twenty words w(n):  0, 1, 00, 01, 10, 000, 11, 001, 010, 100, 0000, 011, 101, 0001, 110, 0010, 0100, 1000, 00000, 111; so a(4) = 2.

Mathematica

(See A341258.)

Crossrefs

Cf. A341258, A342910.

Sequence in context: A091325 A193596 A275420 * A343853 A143974 A301565

Adjacent sequences: A344958 A344959 A344960 * A344962 A344963 A344964

Keyword

nonn,base

Author

Clark Kimberling, Jul 10 2021

Status

approved