A111125 → 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(-24 + 6\,x + 3\,x^{2} + 25\,n - 4\,n x - 2\,n x^{2} - 9\,n^{2} + 2\,n^{3}\right)\,P_{n}(x) = \left(-6 + 4\,x^{2} + x^{3} + 13\,n - n x - 5\,n x^{2} - n x^{3} - 3\,n^{2} - 2\,n^{2} x + 2\,n^{3} + n^{3} x\right)\,P_{n-1}(x) + \left(12\,x - 13\,x^{2} - 8\,x^{3} - x^{4} - 8\,n x - 2\,n x^{2} + 4\,n^{2} x + n^{2} x^{2}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
111
2415
3107118
4212810160
5398454131191
66620920988161589
71044556504161301911775
8155896172815507251802215257
92211632408048623145115623825115360
103042793877813376113625719172930428144394
1140645431752333176356722337396042464378311127171
12529708432890756471001658243243792151803381460341361595
136751066058630160875256750258400171360763802287545005503711021693
14846155611000353226086099607353185930283283201258743316558416484012871245
1510442212716437261526413587081929602185466612430565895121980994657474247544318031246

Computed in your browser ?

Technical details
Node id
n-5ad11fc70a3588cf · revision 1 · JSON
Definition source
derived:one_plus_derivative
Fingerprint
f6-5aabb12a2c39c57b

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

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:   1;
   2:   4,    1;
   3:  10,    7,    1;
   4:  21,   28,   10,     1;
   5:  39,   84,   54,    13,     1;
   6:  66,  209,  209,    88,    16,    1;
   7: 104,  455,  650,   416,   130,   19,    1;
   8: 155,  896, 1728,  1550,   725,  180,   22,   1;
   9: 221, 1632, 4080,  4862,  3145, 1156,  238,  25,  1;
  10: 304, 2793, 8778, 13376, 11362, 5719, 1729, 304, 28, 1;
%F Formula
The row polynomials satisfy (2*n^3-9*n^2+25*n-24-(4*n-6)*x-(2*n-3)*x^2)*P(n,x) = (2*n^3-3*n^2+13*n-6+(n^3-2*n^2-n)*x-(5*n-4)*x^2-(n-1)*x^3)*P(n-1,x) + ((4*n^2-8*n+12)*x+(n^2-2*n-13)*x^2-8*x^3-x^4)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t Mathematica
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((2*n^3 - 3*n^2 + 13*n - 6 + (n^3 - 2*n^2 - n)*x - (5*n - 4)*x^2 - (n - 1)*x^3)*P[n - 1, x] + ((4*n^2 - 8*n + 12)*x + (n^2 - 2*n - 13)*x^2 - 8*x^3 - x^4)*D[P[n - 1, x], x])/(2*n^3 - 9*n^2 + 25*n - 24 - (4*n - 6)*x - (2*n - 3)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = ((2*n^3 - 3*n^2 + 13*n - 6 + (n^3 - 2*n^2 - n)*x - (5*n - 4)*x^2 - (n - 1)*x^3)*v[i - 1] + ((4*n^2 - 8*n + 12)*x + (n^2 - 2*n - 13)*x^2 - 8*x^3 - x^4)*deriv(v[i - 1], x))/(2*n^3 - 9*n^2 + 25*n - 24 - (4*n - 6)*x - (2*n - 3)*x^2)); 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-23729e33b528c150
  • 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-23729e33b528c150
  • 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-23729e33b528c150
  • Interlacing of consecutive rows. Rows P_(m-1), P_m interlace (weak, unordered) for every m >= 2
    The roots of consecutive polynomials alternate on the real line.
    by the cited steps: e-23729e33b528c150

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. [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
  2. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.
  3. [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023