A008292 → γ (scale 1/4) → D

nonnegative coefficients

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

Recurrence
\(\left(-3 + n\right)\,P_{n}(x) = \left(16 - 40\,x + 30\,x^{2} - 8\,n + 28\,n x - 31\,n x^{2} - 4\,n^{2} x + 10\,n^{2} x^{2} - n^{3} x^{2}\right)\,P_{n-2}(x) + \left(8\,x - 20\,x^{2} + 12\,x^{3} - 4\,n x + 14\,n x^{2} - 10\,n x^{3} - 2\,n^{2} x^{2} + 2\,n^{2} x^{3}\right)\,P_{n-2}'(x) + \left(-16 + 24\,x + 6\,n - 14\,n x + 2\,n^{2} x\right)\,P_{n-1}(x) + \left(-6\,x + 6\,x^{2} + 2\,n x - 2\,n x^{2}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 0\)
\(P_{2}(x) = 0\)
\(P_{3}(x) = 2\)

Rows ?

nx0x1x2x3x4x5x6Pn(1)
10
20
322
41616
58832120
6416544960
7182457608168400
87680491522380880640
93161637171241164831744846720
101285122609664552345614151689676800
115186561745715263760128362455041768960119750400
1220848641130414086671953927025090561118412801596672000
138361984715776000652449792011473059840397650432013420953622832409600
143349708844618956806078529536016692658176010508335104011422543872348713164800
151340948482750831001654651795456022365952409602304291348480538215677952133263011845666588928000

Generated b-files: A090672 (row sums) ?

Computed in your browser ?

Technical details
Node id
n-257f18c36ea7f6c1 · revision 1 · JSON
Definition source
derived:derivative
Fingerprint
f6-044c7700ca6fa40f

Observed on the stored rows ?

  • Degrees: -1, -1, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6 (half affine: slope 1, intercept -3)
  • 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 ?

A generated b-file is computed from the node's definition along the row alignment of its OEIS link and starts at the entry's offset. It is an identification on a finite prefix, not a proof that the node and the OEIS entry agree for every n.

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:      0;
   3:      2;
   4:     16;
   5:     88,      32;
   6:    416,     544;
   7:   1824,    5760,     816;
   8:   7680,   49152,   23808;
   9:  31616,  371712,  411648,   31744;
  10: 128512, 2609664, 5523456, 1415168;
%F Formula
The row polynomials satisfy (n-3)*P(n,x) = -(8*n-16+(4*n^2-28*n+40)*x+(n^3-10*n^2+31*n-30)*x^2)*P(n-2,x) - ((4*n-8)*x+(2*n^2-14*n+20)*x^2-(2*n^2-10*n+12)*x^3)*d/dx P(n-2,x) + (6*n-16+(2*n^2-14*n+24)*x)*P(n-1,x) + ((2*n-6)*x-(2*n-6)*x^2)*d/dx P(n-1,x) for n >= 4, with P(1,x) = 0, P(2,x) = 0, P(3,x) = 2.
%t Mathematica
P[1, x_] := 0;
P[2, x_] := 0;
P[3, x_] := 2;
P[n_, x_] := P[n, x] = Expand[Together[(-(8*n - 16 + (4*n^2 - 28*n + 40)*x + (n^3 - 10*n^2 + 31*n - 30)*x^2)*P[n - 2, x] - ((4*n - 8)*x + (2*n^2 - 14*n + 20)*x^2 - (2*n^2 - 10*n + 12)*x^3)*D[P[n - 2, x], x] + (6*n - 16 + (2*n^2 - 14*n + 24)*x)*P[n - 1, x] + ((2*n - 6)*x - (2*n - 6)*x^2)*D[P[n - 1, x], x])/(n - 3)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 0; v[2] = 0; v[3] = 2; for(n = 4, N, my(i = n); v[i] = (-(8*n - 16 + (4*n^2 - 28*n + 40)*x + (n^3 - 10*n^2 + 31*n - 30)*x^2)*v[i - 2] - ((4*n - 8)*x + (2*n^2 - 14*n + 20)*x^2 - (2*n^2 - 10*n + 12)*x^3)*deriv(v[i - 2], x) + (6*n - 16 + (2*n^2 - 14*n + 24)*x)*v[i - 1] + ((2*n - 6)*x - (2*n - 6)*x^2)*deriv(v[i - 1], x))/(n - 3)); 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-8e26a090fdb1b7db
  • 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-8e26a090fdb1b7db
  • 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-8e26a090fdb1b7db

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

Same fingerprint (1)

Equal up to content, sign, reversal and a small index shift.

References

  1. [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
  2. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.