login
A043282
Maximal run length in base 8 representation of n.
4
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, 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, 1, 1, 1, 2, 3, 2, 2, 2, 2, 2, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1
OFFSET
1,9
LINKS
MATHEMATICA
A043282[n_]:=Max[Map[Length, Split[IntegerDigits[n, 8]]]]; Array[A043282, 100] (* Paolo Xausa, Sep 27 2023 *)
PROG
(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
(Python)
from itertools import groupby
def A043282(n): return max(len(list(g)) for k, g in groupby(oct(n)[2:])) # Chai Wah Wu, Mar 09 2023
CROSSREFS
Cf. A007094 (base 8).
Cf. A043276-A043290 for base-2 to base-16 analogs.
Sequence in context: A139553 A078379 A121657 * A031226 A031242 A340102
KEYWORD
nonn,base
STATUS
approved