|
|
A043289
|
|
Maximal run length in base-15 representation of n.
|
|
8
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,16
|
|
LINKS
|
|
|
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
|
|
|
PROG
|
(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
|
|
CROSSREFS
|
Cf. A135518 (positions of records, also the first occurrence of each n).
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|