OFFSET
1,4
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
FORMULA
Is a(n)-floor(log(n)) bounded ?
EXAMPLE
(x-1)(x-2)(x-3) = x^3 - 6*x^2 + 11*x - 6, 11 is the largest coefficient for x^1, hence a(3)=1
MAPLE
N:= 200: # for a(1)..a(N)
V:= Vector(N): L:= <1>:
for n from 1 to N do
L:= -n*<L, 0> + <0, L>;
V[n]:= max[index](L)[1]-1
od:
convert(V, list); # Robert Israel, Aug 27 2020
CROSSREFS
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Nov 10 2002
STATUS
approved