A081580 → D+1

nonnegative coefficients

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

Recurrence
\(\left(-10\,n + 52\,n x - 49\,n x^{2} + 18\,n x^{3} + n x^{4} + 16\,n^{2} - 25\,n^{2} x + 20\,n^{2} x^{2} + n^{2} x^{3} - 6\,n^{3} + 6\,n^{3} x\right)\,P_{n}(x) = \left(-351\,x^{2} + 199\,x^{3} + 31\,x^{4} + x^{5} - 4\,n - 95\,n x + 540\,n x^{2} - 179\,n x^{3} - 10\,n x^{4} + 10\,n^{2} + 227\,n^{2} x - 214\,n^{2} x^{2} - 11\,n^{2} x^{3} - 6\,n^{3} - 66\,n^{3} x\right)\,P_{n-1}(x) + \left(-10\,x^{2} - 199\,x^{3} + 453\,x^{4} + 43\,x^{5} + x^{6} - 4\,n x - 67\,n x^{2} + 459\,n x^{3} + 43\,n x^{4} + n x^{5} + 6\,n^{2} x + 132\,n^{2} x^{2} + 6\,n^{2} x^{3}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1213
289118
3143916170
420141118231303
5263155802453011197
632561205016554203714756
73887951767925369064344118396
8441269106062791122800700991451170605
9501731189887565310440653695119361233581267751
10562265309701703753677403061571097901879516006511007814
1162287147200336485104349013484597547722024252791020157213765762
1268354968326603575251268047509214027178163622734510039605247879113989787
137442999499610064215345550139177031719648810312257321512255347554204298986151703665
14805121127858158498310340436352143256058290252161531234555765848937845370720313548931190242792

Computed in your browser ?

Technical details
Node id
n-c06014e4fc115098 · revision 1 · JSON
Definition source
derived:one_plus_derivative
Fingerprint
f6-9aaa0d8487791a01

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

OEIS matches ?

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 = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:  1;
  1:  2,    1;
  2:  8,    9,     1;
  3: 14,   39,    16,     1;
  4: 20,  141,   118,    23,      1;
  5: 26,  315,   580,   245,     30,     1;
  6: 32,  561,  2050,  1655,    420,    37,     1;
  7: 38,  879,  5176,  7925,   3690,   643,    44,    1;
  8: 44, 1269, 10606, 27911,  22800,  7009,   914,   51,  1;
  9: 50, 1731, 18988, 75653, 104406, 53695, 11936, 1233, 58, 1;
%F Formula
The row polynomials satisfy -(6*n^3-16*n^2+10*n-(6*n^3-25*n^2+52*n)*x-(20*n^2-49*n)*x^2-(n^2+18*n)*x^3-n*x^4)*P(n,x) = -(6*n^3-10*n^2+4*n+(66*n^3-227*n^2+95*n)*x+(214*n^2-540*n+351)*x^2+(11*n^2+179*n-199)*x^3+(10*n-31)*x^4-x^5)*P(n-1,x) + ((6*n^2-4*n)*x+(132*n^2-67*n-10)*x^2+(6*n^2+459*n-199)*x^3+(43*n+453)*x^4+(n+43)*x^5+x^6)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[(-(6*n^3 - 10*n^2 + 4*n + (66*n^3 - 227*n^2 + 95*n)*x + (214*n^2 - 540*n + 351)*x^2 + (11*n^2 + 179*n - 199)*x^3 + (10*n - 31)*x^4 - x^5)*P[n - 1, x] + ((6*n^2 - 4*n)*x + (132*n^2 - 67*n - 10)*x^2 + (6*n^2 + 459*n - 199)*x^3 + (43*n + 453)*x^4 + (n + 43)*x^5 + x^6)*D[P[n - 1, x], x])/(-6*n^3 + 16*n^2 - 10*n + (6*n^3 - 25*n^2 + 52*n)*x + (20*n^2 - 49*n)*x^2 + (n^2 + 18*n)*x^3 + n*x^4)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (-(6*n^3 - 10*n^2 + 4*n + (66*n^3 - 227*n^2 + 95*n)*x + (214*n^2 - 540*n + 351)*x^2 + (11*n^2 + 179*n - 199)*x^3 + (10*n - 31)*x^4 - x^5)*v[i - 1] + ((6*n^2 - 4*n)*x + (132*n^2 - 67*n - 10)*x^2 + (6*n^2 + 459*n - 199)*x^3 + (43*n + 453)*x^4 + (n + 43)*x^5 + x^6)*deriv(v[i - 1], x))/(-6*n^3 + 16*n^2 - 10*n + (6*n^3 - 25*n^2 + 52*n)*x + (20*n^2 - 49*n)*x^2 + (n^2 + 18*n)*x^3 + n*x^4)); 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)

Generated with polytool c48629374597.

Proved properties

  • Real-rooted. Every row P_n, n >= 0, 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-5eeadacb5f413009
  • Coefficients of one sign. Every nonzero row, n >= 0: 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-5eeadacb5f413009
  • Hadamard kernel (Malo). Rows P_n, n >= 0, 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-5eeadacb5f413009
  • Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 1
    The roots of consecutive polynomials alternate on the real line.
    by the cited steps: e-5eeadacb5f413009

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. [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.