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