A028338 → basis A013611 → D

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6Pn(1)
00
144
2243256
3176384192752
4160044803840102410944
5175365760065280307205120176256
62257928314881128960716800215040245763142656
733454081344716820794368160563206594560137625611468861728768
Technical details
Node id
n-722875f27763f6cc · revision 0 · JSON
Definition source
derived:derivative
Fingerprint
f6-74cf33eb0a23e7a7

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:          4;
  2:         24,         32;
  3:        176,        384,        192;
  4:       1600,       4480,       3840,       1024;
  5:      17536,      57600,      65280,      30720,       5120;
  6:     225792,     831488,    1128960,     716800,     215040,      24576;
  7:    3345408,   13447168,   20794368,   16056320,    6594560,    1376256,    114688;
  8:   56107008,  241917952,  413392896,  367804416,  185794560,   53673984,   8257536,   524288;
  9: 1051213824, 4803379200, 8892579840, 8825241600, 5183324160, 1857945600, 399114240, 47185920, 2359296;
%F Formula
The row polynomials satisfy P(n,x) = -(4*n^2-8*n+4+(16*n-16)*x+16*x^2)*P(n-2,x) + (4*n-2+8*x)*P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 4.
%t Mathematica
P[0, x_] := 0;
P[1, x_] := 4;
P[n_, x_] := P[n, x] = Expand[-(4*n^2 - 8*n + 4 + (16*n - 16)*x + 16*x^2)*P[n - 2, x] + (4*n - 2 + 8*x)*P[n - 1, x]];
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] = 4; for(n = 2, N, my(i = n + 1); v[i] = -(4*n^2 - 8*n + 4 + (16*n - 16)*x + 16*x^2)*v[i - 2] + (4*n - 2 + 8*x)*v[i - 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. [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
  2. [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
  3. [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
  4. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.