basis-map coefficients of A021012 → basis A008277 → D+1

Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel

Recurrence

\(P_{n}(x) = \left(2 + x - 2\,n - n x\right)\,P_{n-1}(x) + \left(x - n x\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
2-2-1-3
3810220
4-48-114-54-6-222
538415601320336243624
6-3840-25320-34200-15000-2400-120-80880
746080478800972720655200176400194407202349360
8-645120-10377360-30587760-29741040-11995200-2187360-176400-5040-85715280
Technical details
Node id
n-db5604866e0dcab5 · revision 0 · JSON
Definition source
derived:one_plus_derivative
Fingerprint
f6-b5f1389370a379f1

Observed on the stored rows ?

  • Degrees: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 (affine: slope 1, intercept -1)
  • Palindromic rows: no
  • γ-positive (gamma_positive): no
  • Nonnegative coefficients (nonn): no
  • Only rational roots (rr_by_factors: every nonzero row is a product of linear factors over ℚ): no

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:          1;
   2:         -2,          -1;
   3:          8,          10,            2;
   4:        -48,        -114,          -54,           -6;
   5:        384,        1560,         1320,          336,           24;
   6:      -3840,      -25320,       -34200,       -15000,        -2400,         -120;
   7:      46080,      478800,       972720,       655200,       176400,        19440,         720;
   8:    -645120,   -10377360,    -30587760,    -29741040,    -11995200,     -2187360,     -176400,      -5040;
   9:   10321920,   254217600,   1061827200,   1434343680,    813697920,    218453760,    28788480,    1774080,     40320;
  10: -185794560, -6956772480, -40513737600, -74101910400, -56848780800, -21085868160, -4038854400, -402796800, -19595520, -362880;
%F Formula
The row polynomials satisfy P(n,x) = -(2*n-2+(n-1)*x)*P(n-1,x) - (n-1)*x*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t Mathematica
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[-(2*n - 2 + (n - 1)*x)*P[n - 1, x] - (n - 1)*x*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = -(2*n - 2 + (n - 1)*x)*v[i - 1] - (n - 1)*x*deriv(v[i - 1], x)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

polytool c48629374597

Properties

Proof chains ? JSON

Same fingerprint ?

References

  1. [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
  2. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.