A281000 → D

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6Pn(1)
10
211
310212
470423115
542050410841036
623104620198022059135
71201236036257405720390679904
860060252252270270100100136506307696969
Technical details
Node id
n-543256a15ee14711 · revision 0 · JSON
Definition source
derived:derivative
Fingerprint
f6-e65c25f9531a60c5

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 -2)
  • 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 = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:       0;
   2:       1;
   3:      10,       2;
   4:      70,      42,        3;
   5:     420,     504,      108,        4;
   6:    2310,    4620,     1980,      220,       5;
   7:   12012,   36036,    25740,     5720,     390,      6;
   8:   60060,  252252,   270270,   100100,   13650,    630,     7;
   9:  291720, 1633632,  2450448,  1361360,  309400,  28560,   952,    8;
  10: 1385670, 9976824, 19953648, 15519504, 5290740, 813960, 54264, 1368, 9;
%F Formula
The row polynomials satisfy (2*n^2-3*n-2)*P(n,x) = (8*n^2-2+(6*n^2-16*n+8)*x)*P(n-1,x) + ((16*n-12)*x-(4*n-3)*x^2)*d/dx P(n-1,x) for n >= 3, with P(1,x) = 0, P(2,x) = 1.
%t Mathematica
P[1, x_] := 0;
P[2, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((8*n^2 - 2 + (6*n^2 - 16*n + 8)*x)*P[n - 1, x] + ((16*n - 12)*x - (4*n - 3)*x^2)*D[P[n - 1, x], x])/(2*n^2 - 3*n - 2)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 0; v[2] = 1; for(n = 3, N, my(i = n); v[i] = ((8*n^2 - 2 + (6*n^2 - 16*n + 8)*x)*v[i - 1] + ((16*n - 12)*x - (4*n - 3)*x^2)*deriv(v[i - 1], x))/(2*n^2 - 3*n - 2)); 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

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.