A285061 → D

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6Pn(1)
00
144
2243256
3124480192796
462453125376102412336
5312452800101760460805120208884
61562450019216396801326080337920245763844072
7781244626720243169923128832013726720223641611468876387980
Technical details
Node id
n-b081b98b73e99863 · revision 0 · JSON
Definition source
derived:derivative
Fingerprint
f6-7af788cb0422c847

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:     124,       480,        192;
  4:     624,      5312,       5376,        1024;
  5:    3124,     52800,     101760,       46080,        5120;
  6:   15624,    500192,    1639680,     1326080,      337920,      24576;
  7:   78124,   4626720,   24316992,    31288320,    13726720,    2236416,    114688;
  8:  390624,  42265472,  343881216,   661592064,   444702720,  121798656,  13762560,   524288;
  9: 1953124, 383514240, 4724048640, 13081098240, 12646717440, 5179539456, 967507968, 80216064, 2359296;
%F Formula
The row polynomials satisfy P(n,x) = -(5+8*x+16*x^2)*P(n-2,x) - (4*x+16*x^2)*d/dx P(n-2,x) + (6+8*x)*P(n-1,x) + 4*x*d/dx 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[-(5 + 8*x + 16*x^2)*P[n - 2, x] - (4*x + 16*x^2)*D[P[n - 2, x], x] + (6 + 8*x)*P[n - 1, x] + 4*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] = 0; v[2] = 4; for(n = 2, N, my(i = n + 1); v[i] = -(5 + 8*x + 16*x^2)*v[i - 2] - (4*x + 16*x^2)*deriv(v[i - 2], x) + (6 + 8*x)*v[i - 1] + 4*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

Proof chains ? JSON

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.