A253284 → D

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6Pn(1)
00
122
2182442
3144480360984
41200720012600672027720
510800100800302400362880151200928080
6105840141120063504001270080011642400399168036202320
71128960203212801270080003725568005588352004151347201210809601616065920
Technical details
Node id
n-c2b64ab37daf9153 · revision 0 · JSON
Definition source
derived:derivative
Fingerprint
f6-3961bf8dfc4504b6

Observed on the stored rows ?

  • Degrees: -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (affine: slope 1, intercept -1)
  • 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:         0;
  1:         2;
  2:        18,         24;
  3:       144,        480,         360;
  4:      1200,       7200,       12600,         6720;
  5:     10800,     100800,      302400,       362880,       151200;
  6:    105840,    1411200,     6350400,     12700800,     11642400,       3991680;
  7:   1128960,   20321280,   127008000,    372556800,    558835200,     415134720,     121080960;
  8:  13063680,  304819200,  2514758400,  10059033600,  21794572800,   26153487360,   16345929600,   4151347200;
  9: 163296000, 4790016000, 50295168000, 261534873600, 762810048000, 1307674368000, 1307674368000, 705729024000, 158789030400;
%F Formula
The row polynomials satisfy (n-1)*P(n,x) = (n^2+2*n+1+(2*n^2+2*n)*x)*P(n-1,x) + (2*n*x+2*n*x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 2.
%t Mathematica
P[0, x_] := 0;
P[1, x_] := 2;
P[n_, x_] := P[n, x] = Expand[Together[((n^2 + 2*n + 1 + (2*n^2 + 2*n)*x)*P[n - 1, x] + (2*n*x + 2*n*x^2)*D[P[n - 1, x], x])/(n - 1)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 2; for(n = 2, N, my(i = n + 1); v[i] = ((n^2 + 2*n + 1 + (2*n^2 + 2*n)*x)*v[i - 1] + (2*n*x + 2*n*x^2)*deriv(v[i - 1], x))/(n - 1)); 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

Proof chains ? JSON

Same fingerprint ?

References

  1. [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
  2. [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
  3. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.