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”).

A043277
Maximal run length in base 3 representation of n.
9
1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 2, 3, 2, 1, 1, 2, 2, 1, 1, 1, 2, 1, 2, 2, 3, 3, 2, 2, 1, 2, 1, 1, 1, 2, 2, 2, 2, 3, 4, 3, 2, 2, 2, 2, 1, 1, 1, 2, 1, 2, 2, 3, 3, 2, 2, 1, 2, 1, 1, 1, 2, 2, 1, 1, 2, 3, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2
OFFSET
1,4
COMMENTS
Sequences A031941, A037973, A037974, A037975 list numbers for which a(n)=1, a(n)=2, a(n)=3, a(n)=4. - M. F. Hasler, Jul 23 2013
A003462 gives the positions of records. - R. J. Mathar, Jul 26 2015
LINKS
MAPLE
mRunLen := proc(L)
if nops(L) = 0 then
0;
else
a := 1 ;
for i from 2 to nops(L) do
if op(i, L) = op(i-1, L) then
a := a+1 ;
else
a := max(a, procname([op(i..nops(L), L)])) ;
break;
end if;
end do:
a ;
end if ;
end proc:
A043277 := proc(n)
convert(n, base, 3) ;
mRunLen(%) ;
end proc:
seq(A043277(n), n=1..100) ; # R. J. Mathar, Jul 26 2015
MATHEMATICA
Table[Max[Length/@Split[IntegerDigits[n, 3]]], {n, 90}] (* Harvey P. Dale, Aug 24 2019 *)
PROG
(PARI) A043277(n, b=3)={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
CROSSREFS
Cf. A043276-A043290 for base-2 to base-16 analogs.
Sequence in context: A025890 A334440 A316975 * A379018 A265991 A353841
KEYWORD
nonn,base
STATUS
approved