A127952 → basis A007318

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1224
269318
3163220472
44010090355270
596288336192546972
622478411208403507773402
75122048345632001760576104811664
Technical details
Node id
n-29ea4bcda6322811 · revision 0 · JSON
Definition source
derived:basis_map_A007318
Fingerprint
f6-04668acf2e74f66d

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 ℚ): yes

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:    1;
  1:    2,     2;
  2:    6,     9,     3;
  3:   16,    32,    20,     4;
  4:   40,   100,    90,    35,     5;
  5:   96,   288,   336,   192,    54,     6;
  6:  224,   784,  1120,   840,   350,    77,    7;
  7:  512,  2048,  3456,  3200,  1760,   576,  104,    8;
  8: 1152,  5184, 10080, 11088,  7560,  3276,  882,  135,   9;
  9: 2560, 12800, 28160, 35840, 29120, 15680, 5600, 1280, 170, 10;
%F Formula
The row polynomials satisfy (n-2)*P(n,x) = -(4*n-8+(4*n-8)*x+(n-2)*x^2)*P(n-2,x) + (4*n-8+(2*n-4)*x)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 2 + 2*x, P(2,x) = 6 + 9*x + 3*x^2.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2 + 2*x;
P[2, x_] := 6 + 9*x + 3*x^2;
P[n_, x_] := P[n, x] = Expand[Together[(-(4*n - 8 + (4*n - 8)*x + (n - 2)*x^2)*P[n - 2, x] + (4*n - 8 + (2*n - 4)*x)*P[n - 1, x])/(n - 2)]];
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] = 2 + 2*x; v[3] = 6 + 9*x + 3*x^2; for(n = 3, N, my(i = n + 1); v[i] = (-(4*n - 8 + (4*n - 8)*x + (n - 2)*x^2)*v[i - 2] + (4*n - 8 + (2*n - 4)*x)*v[i - 1])/(n - 2)); 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.