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 A043283 #23 Sep 27 2023 07:44:49 %S A043283 1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,2,1,1,1,1, %T A043283 1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1, %U A043283 1,2,1,1,1,1,1,1,1,1,1,2,2,1,1,1,1,1,1,1,1,2 %N A043283 Maximal run length in base-9 representation of n. %H A043283 Antti Karttunen, <a href="/A043283/b043283.txt">Table of n, a(n) for n = 1..66430</a> %t A043283 A043283[n_]:=Max[Map[Length,Split[IntegerDigits[n,9]]]];Array[A043283,100] (* _Paolo Xausa_, Sep 27 2023 *) %o A043283 (PARI) A043283(n, b=9)={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 %Y A043283 Cf. A007095. %Y A043283 Cf. A043276-A043290 for base-2 to base-16 analogs. %Y A043283 Cf. A002452 (gives the positions of records, the first occurrence of each n). %Y A043283 Cf. also A044940. %K A043283 nonn,base %O A043283 1,10 %A A043283 _Clark Kimberling_