A008277 → θ+1 → D

nonnegative coefficients

Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · Hadamard kernel what this means

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

Rows ?

nx0x1x2x3x4x5x6Pn(1)
10
222
36612
414361262
53015012020320
662540780300301712
7126180642002800630429604
825457962041221000798011765656674

Computed in your browser ?

Technical details
Node id
n-0b1f6ba1d052e73d · revision 1 · JSON
Definition source
derived:derivative
Fingerprint
f6-d2ae1a9b87b0cc30

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 -2)
  • 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

OEIS matches ?

OEIS submission text ?

Fields to paste into an OEIS submission: the example %e, the formula %F and programs %t (Mathematica) and %o (PARI/GP) that list the same rows. For an OEIS link the row numbers, the offset and the orientation are those of the entry, as matched; the matched terms were compared with the published ones, which identifies the node with the entry on a finite prefix, not for every n. The PARI/GP program is not machine-checked here.

The atlas's own rows: n = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:    0;
   2:    2;
   3:    6,     6;
   4:   14,    36,     12;
   5:   30,   150,    120,     20;
   6:   62,   540,    780,    300,     30;
   7:  126,  1806,   4200,   2800,    630,     42;
   8:  254,  5796,  20412,  21000,   7980,   1176,    56;
   9:  510, 18150,  93240, 139020,  79380,  19404,  2016,   72;
  10: 1022, 55980, 409260, 850500, 684810, 246960, 42000, 3240, 90;
%F Formula
The row polynomials satisfy P(n,x) = -(3*x^2-x^3)*P(n-3,x) - 3*x^2*d/dx P(n-3,x) - x^3*d^2/dx^2 P(n-3,x) - (2+3*x^2)*P(n-2,x) + 2*x*d/dx P(n-2,x) + x^2*d^2/dx^2 P(n-2,x) + (3+3*x)*P(n-1,x) for n >= 4, with P(1,x) = 0, P(2,x) = 2, P(3,x) = 6 + 6*x.
%t Mathematica
P[1, x_] := 0;
P[2, x_] := 2;
P[3, x_] := 6 + 6*x;
P[n_, x_] := P[n, x] = Expand[-(3*x^2 - x^3)*P[n - 3, x] - 3*x^2*D[P[n - 3, x], x] - x^3*D[P[n - 3, x], {x, 2}] - (2 + 3*x^2)*P[n - 2, x] + 2*x*D[P[n - 2, x], x] + x^2*D[P[n - 2, x], {x, 2}] + (3 + 3*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 0; v[2] = 2; v[3] = 6 + 6*x; for(n = 4, N, my(i = n); v[i] = -(3*x^2 - x^3)*v[i - 3] - 3*x^2*deriv(v[i - 3], x) - x^3*deriv(deriv(v[i - 3], x), x) - (2 + 3*x^2)*v[i - 2] + 2*x*deriv(v[i - 2], x) + x^2*deriv(deriv(v[i - 2], x), x) + (3 + 3*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, v[i])))};
T(10)

Generated with polytool c48629374597.

Proved properties

  • Real-rooted. Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-b376e17507db55c7
  • Coefficients of one sign. Every nonzero row, n >= 1: the coefficients of P_n have one sign
    All coefficients of each polynomial have the same sign (after x -> -x when alternating).
    derived from the cited steps by a stated theorem: e-b376e17507db55c7
  • Hadamard kernel (Malo). Rows P_n, n >= 1, are Hadamard kernels (preserve real-rootedness)
    Multiplying the coefficients of any real-rooted polynomial termwise by those of a row (Hadamard product) gives a real-rooted polynomial again.
    derived from the cited steps by a stated theorem: e-b376e17507db55c7

Proof chains

1 incoming proof step. Each step is expanded back to the roots of the proof DAG, the theorem checks of a node's own rule. JSON

No candidate equalities or related sequences.

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. [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
  4. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.