A131222 → basis A008277

nonnegative coefficients

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

Recurrence

\(P_{n}(x) = \left(-4 + 6\,n - 2\,n^{2}\right)\,P_{n-2}(x) + \left(-2 + x + 3\,n\right)\,P_{n-1}(x) + \left(x\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1 + x\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1112
246111
3244815188
4192480216281917
519205760336064045111726
6230408064057600144001500661177247
7322560129024010886403360004620030249113086756
Technical details
Node id
n-3b33c24113e19b2d · revision 0 · JSON
Definition source
derived:basis_map_A008277
Fingerprint
f6-af1c21729eec5b0e

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 0)
  • Palindromic rows: no
  • γ-positive (gamma_positive): no
  • Nonnegative coefficients (nonn): yes
  • 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 = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:        1;
  1:        1,         1;
  2:        4,         6,         1;
  3:       24,        48,        15,         1;
  4:      192,       480,       216,        28,        1;
  5:     1920,      5760,      3360,       640,       45,       1;
  6:    23040,     80640,     57600,     14400,     1500,      66,      1;
  7:   322560,   1290240,   1088640,    336000,    46200,    3024,     91,    1;
  8:  5160960,  23224320,  22579200,   8279040,  1411200,  122304,   5488,  120,   1;
  9: 92897280, 464486400, 510935040, 216760320, 44029440, 4741632, 282240, 9216, 153, 1;
%F Formula
The row polynomials satisfy P(n,x) = -(2*n^2-6*n+4)*P(n-2,x) + (3*n-2+x)*P(n-1,x) + x*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 1 + x;
P[n_, x_] := P[n, x] = Expand[-(2*n^2 - 6*n + 4)*P[n - 2, x] + (3*n - 2 + x)*P[n - 1, x] + x*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + x; for(n = 2, N, my(i = n + 1); v[i] = -(2*n^2 - 6*n + 4)*v[i - 2] + (3*n - 2 + x)*v[i - 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 - 1, v[i])))};
T(9)

polytool c48629374597

Properties

  • Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
  • Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
    derived from Ray basis map theorem
  • Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
    derived from Ray basis map theorem

Proof chains ? JSON

References

  1. [LW07] Lily L. Liu and Yi Wang. A unified approach to polynomial sequences with only real zeros. Advances in Applied Mathematics, 38(4):542–560, May 2007. doi:10.1016/j.aam.2006.02.003
  2. [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