login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A043284
Maximal run length in base-10 representation of n.
5
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2
OFFSET
1,11
COMMENTS
The first term larger than 2 is a(111) = 3. - M. F. Hasler, Jul 21 2013
FORMULA
For n < 111, a(n) = 1 except for a(n) = 2 when n==0 (mod 11) or n = 100. - M. F. Hasler, Jul 21 2013
MATHEMATICA
A043284[n_]:=Max[Map[Length, Split[IntegerDigits[n]]]]; Array[A043284, 100] (* Paolo Xausa, Sep 27 2023 *)
PROG
(PARI) A043284(n)={my(m, c=1); while(n>0, n%10==(n\=10)%10 && c++ && next; m=max(m, c); c=1); m} \\ M. F. Hasler, Jul 23 2013
CROSSREFS
Cf. A043276-A043290 for base-2 to base-16 analogs.
Cf. A030556-A030561, A030575-A030580 (related to base-6 run lengths).
Cf. A227186, A227188, A101211, A005811 (related to base-2 run lengths).
Sequence in context: A110503 A030556 A083230 * A030575 A350040 A280940
KEYWORD
nonn,base
EXTENSIONS
Data completed up to a(100), first difference with A083230, by M. F. Hasler, Oct 18 2019
STATUS
approved