A338624 a(n) is the length of the longest block of consecutive terms appearing twice (possibly with overlap) among the first n terms of the Kolakoski sequence (A000002).

0, 0, 1, 1, 1, 2, 2, 2, 3, 4, 4, 4, 5, 5, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 9, 10, 10, 10, 10, 10, 10, 10, 11, 12, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 16, 17, 18, 18

Offset

1,6

Comments

This sequence is weakly increasing and unbounded (as A000002 is bounded).

Links

Rémy Sigrist, Table of n, a(n) for n = 1..10000

Rémy Sigrist, PARI program for A338624

Formula

a(n) <= a(n+1) <= a(n) + 1.

Prog

(PARI) See Links section.

Crossrefs

Cf. A000002, A338623 (Thue-Morse variant).

Sequence in context: A090702 A029124 A113512 * A194169 A194165 A004524

Adjacent sequences: A338621 A338622 A338623 * A338625 A338626 A338627

Keyword

nonn

Author

Rémy Sigrist, Nov 04 2020

Status

approved