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 A043282 #23 Sep 27 2023 06:32:46 %S A043282 1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1, %T A043282 1,2,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,2,2,1,1,1,1, %U A043282 1,1,1,2,3,2,2,2,2,2,2,1,1,2,1,1,1,1,1,1,1,1 %N A043282 Maximal run length in base 8 representation of n. %H A043282 Winston de Greef, <a href="/A043282/b043282.txt">Table of n, a(n) for n = 1..10000</a> %t A043282 A043282[n_]:=Max[Map[Length,Split[IntegerDigits[n,8]]]];Array[A043282,100] (* _Paolo Xausa_, Sep 27 2023 *) %o A043282 (PARI) A043282(n, b=8)={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 %o A043282 (Python) %o A043282 from itertools import groupby %o A043282 def A043282(n): return max(len(list(g)) for k, g in groupby(oct(n)[2:])) # _Chai Wah Wu_, Mar 09 2023 %Y A043282 Cf. A007094 (base 8). %Y A043282 Cf. A043276-A043290 for base-2 to base-16 analogs. %K A043282 nonn,base %O A043282 1,9 %A A043282 _Clark Kimberling_