A036969 → D

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6Pn(1)
00
111
2527
32128352
485294904473
53412816188122055263
6136526026343208008455670180
754612369645881592459602639084071103781
Technical details
Node id
n-a4a84eec33e1a48f · revision 0 · JSON
Definition source
derived:derivative
Fingerprint
f6-381b673846e6e94e

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:     1;
  2:     5,        2;
  3:    21,       28,         3;
  4:    85,      294,        90,         4;
  5:   341,     2816,      1881,       220,        5;
  6:  1365,    26026,     34320,      8008,      455,       6;
  7:  5461,   236964,    588159,    245960,    26390,     840,      7;
  8: 21845,  2143598,   9765990,   6933212,  1257490,   72828,   1428,    8;
  9: 87381, 19336072, 159471237, 186351620, 53936155, 5077560, 176358, 2280, 9;
%F Formula
The row polynomials satisfy P(n,x) = -(4+2*x+x^2)*P(n-2,x) - (5*x+4*x^2)*d/dx P(n-2,x) - (x^2+x^3)*d^2/dx^2 P(n-2,x) + (5+2*x)*P(n-1,x) + 5*x*d/dx P(n-1,x) + x^2*d^2/dx^2 P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 1.
%t Mathematica
P[0, x_] := 0;
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[-(4 + 2*x + x^2)*P[n - 2, x] - (5*x + 4*x^2)*D[P[n - 2, x], x] - (x^2 + x^3)*D[P[n - 2, x], {x, 2}] + (5 + 2*x)*P[n - 1, x] + 5*x*D[P[n - 1, x], x] + x^2*D[P[n - 1, x], {x, 2}]];
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] = 1; for(n = 2, N, my(i = n + 1); v[i] = -(4 + 2*x + x^2)*v[i - 2] - (5*x + 4*x^2)*deriv(v[i - 2], x) - (x^2 + x^3)*deriv(deriv(v[i - 2], x), x) + (5 + 2*x)*v[i - 1] + 5*x*deriv(v[i - 1], x) + x^2*deriv(deriv(v[i - 1], x), 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. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.