|
|
A076620
|
|
Coefficient of x^a(n) in (x+1)*(x+2)*...*(x+n) is the largest one.
|
|
4
|
|
|
0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,7
|
|
LINKS
|
|
|
FORMULA
|
Is a(n) - floor(log(n)) bounded?
|
|
EXAMPLE
|
In (x+1)(x+2)(x+3) = x^3 + 6*x^2 + 11*x + 6, the largest coefficient (11) appears at x^1, hence a(3)=1.
|
|
PROG
|
(PARI) a(n) = my(p=prod(j=1, n, x+j), m=vecmax(Vec(p))); for (i=0, poldegree(p), if (polcoef(p, i)==m, return(i))); \\ Michel Marcus, Feb 19 2021
(PARI) first(n) = {res = vector(n); my(r = 1); v = [1]; for(i = 1, n, v = concat(0, v) + concat(v, 0)*i; for(j = r + 1, #v, if(v[j] > v[j - 1], r++ , next ); ); res[i] = r-1 ); res } \\ David A. Corneth, Feb 21 2021
(Python)
from sympy import prod, Poly
from sympy.abc import x
y = Poly(prod(x+i for i in range(1, n+1))).all_coeffs()[::-1]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|