A075498 → D+1

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1415
21811130
39099211211
44868553153411691
527547371418576550115126
6160386407152731144901575691148975
7947705620596480812511814032028989111599401
Technical details
Node id
n-46955655870b4332 · revision 0 · JSON
Definition source
derived:one_plus_derivative
Fingerprint
f6-1c283a95c09a98e0

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

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:       1;
  1:       4,        1;
  2:      18,       11,        1;
  3:      90,       99,       21,        1;
  4:     486,      855,      315,       34,        1;
  5:    2754,     7371,     4185,      765,       50,       1;
  6:   16038,    64071,    52731,    14490,     1575,      69,      1;
  7:   94770,   562059,   648081,   251181,    40320,    2898,     91,    1;
  8:  564246,  4968135,  7869555,  4140234,   920241,   96390,   4914,  116,   1;
  9: 3372354, 44162091, 94992345, 66196845, 19578510, 2801547, 206010, 7830, 144, 1;
%F Formula
The row polynomials satisfy P(n,x) = -(18-3*x-2*x^2)*P(n-2,x) - (9*x-6*x^2)*d/dx P(n-2,x) + (9-x)*P(n-1,x) + 3*x*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 4 + x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 4 + x;
P[n_, x_] := P[n, x] = Expand[-(18 - 3*x - 2*x^2)*P[n - 2, x] - (9*x - 6*x^2)*D[P[n - 2, x], x] + (9 - x)*P[n - 1, x] + 3*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] = 1; v[2] = 4 + x; for(n = 2, N, my(i = n + 1); v[i] = -(18 - 3*x - 2*x^2)*v[i - 2] - (9*x - 6*x^2)*deriv(v[i - 2], x) + (9 - x)*v[i - 1] + 3*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.