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 A043284 #22 Sep 27 2023 07:44:23
%S A043284 1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,2,1,
%T A043284 1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,2,1,1,
%U A043284 1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,2,2
%N A043284 Maximal run length in base-10 representation of n.
%C A043284 The first term larger than 2 is a(111) = 3. - _M. F. Hasler_, Jul 21 2013
%H A043284 Paolo Xausa, <a href="/A043284/b043284.txt">Table of n, a(n) for n = 1..10000</a>
%F A043284 For n < 111, a(n) = 1 except for a(n) = 2 when n==0 (mod 11) or n = 100. - _M. F. Hasler_, Jul 21 2013
%t A043284 A043284[n_]:=Max[Map[Length,Split[IntegerDigits[n]]]];Array[A043284,100] (* _Paolo Xausa_, Sep 27 2023 *)
%o A043284 (PARI) A043284(n)={my(m,c=1);while(n>0,n%10==(n\=10)%10 && c++ && next;m=max(m,c);c=1);m} \\ _M. F. Hasler_, Jul 23 2013
%Y A043284 Cf. A043276-A043290 for base-2 to base-16 analogs.
%Y A043284 Cf. A030556-A030561, A030575-A030580 (related to base-6 run lengths).
%Y A043284 Cf. A227186, A227188, A101211, A005811 (related to base-2 run lengths).
%K A043284 nonn,base
%O A043284 1,11
%A A043284 _Clark Kimberling_
%E A043284 Data completed up to a(100), first difference with A083230, by _M. F. Hasler_, Oct 18 2019