This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A338624 #12 Jul 19 2021 01:22:59 %S A338624 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, %T A338624 10,10,10,10,10,10,11,12,13,14,14,14,14,14,14,14,14,14,14,14,14,14,14, %U A338624 14,14,14,14,14,14,14,14,14,14,14,14,15,16,17,18,18 %N 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). %C A338624 This sequence is weakly increasing and unbounded (as A000002 is bounded). %H A338624 Rémy Sigrist, <a href="/A338624/b338624.txt">Table of n, a(n) for n = 1..10000</a> %H A338624 Rémy Sigrist, <a href="/A338624/a338624.gp.txt">PARI program for A338624</a> %F A338624 a(n) <= a(n+1) <= a(n) + 1. %o A338624 (PARI) See Links section. %Y A338624 Cf. A000002, A338623 (Thue-Morse variant). %K A338624 nonn %O A338624 1,6 %A A338624 _Rémy Sigrist_, Nov 04 2020