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 A043286 #19 Sep 27 2023 10:07:08
%S A043286 1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,
%T A043286 1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,
%U A043286 1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,1,2,1
%N A043286 Maximal run length in base-12 representation of n.
%C A043286 For all numbers n in A023806, a(n)=1, but this holds also for others, e.g., n=145, not in A023806. The same relation holds for the terms of A113763 less than n=144, but becomes wrong from then on. - _M. F. Hasler_, Jul 24 2013
%H A043286 Antti Karttunen, <a href="/A043286/b043286.txt">Table of n, a(n) for n = 1..22621</a>
%t A043286 A043286[n_]:=Max[Map[Length,Split[IntegerDigits[n,12]]]];Array[A043286,100] (* _Paolo Xausa_, Sep 27 2023 *)
%o A043286 (PARI) A043286(n, b=12){=my(m, c=1); while(n>0, n%b==(n\=b)%b&&c++&&next; m=max(m, c); c=1); m} \\ _M. F. Hasler_, Jul 23 2013 - typos fixed by _Antti Karttunen_, Dec 06 2017
%Y A043286 Cf. A043276-A043290 for base-2 to base-16 analogs.
%K A043286 nonn,base
%O A043286 1,13
%A A043286 _Clark Kimberling_
%E A043286 More terms from _Antti Karttunen_, Dec 06 2017