cp's OEIS Frontend

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.

A043289 Maximal run length in base-15 representation of n.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
Offset: 1

Views

Author

Keywords

Crossrefs

Cf. A043276-A043290 for base-2 to base-16 analogs.
Cf. A135518 (positions of records, also the first occurrence of each n).

Programs

  • Maple
    A043289 := proc(n) dgs := convert(n,base,15) ; a :=1 ; rl :=1 ; for i from 2 to nops(dgs) do if op(i,dgs) <> op(i-1,dgs) then a := max(a,rl) ; rl := 1; else rl := rl+1 ; end if; end do: a := max(a,rl) ; a; end proc; # R. J. Mathar, Jan 11 2012
  • Mathematica
    A043289[n_]:=Max[Map[Length,Split[IntegerDigits[n,15]]]];Array[A043289,100] (* Paolo Xausa, Sep 27 2023 *)
  • PARI
    A043289(n,b=15){=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