A116414 → 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(14\,n - 10\,n x - 2\,n x^{2} + 2\,n^{3}\right)\,P_{n}(x) = \left(28 - 20\,x - 10\,x^{2} - x^{3} + 36\,n - 18\,n x - 10\,n x^{2} - n x^{3} + 12\,n^{2} + 3\,n^{2} x + 4\,n^{3} + n^{3} x\right)\,P_{n-1}(x) + \left(-28\,x - 60\,x^{2} - 15\,x^{3} - x^{4} + 4\,n + 8\,n x + n x^{2} + 4\,n^{2} + 8\,n^{2} x + n^{2} x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
011
1516
22110132
38266151164
4305358135201819
5109517239402282514012
6382976445574194034530119363
713124319722957413690347048635192352
84428912792414461084684284155642651401436256
91476254945176643804749002009495260585688404512044430
104871571860022290641524686521272495418824896281236010535019516657
111594326684227812223261120815557391640295730479354814336417130129055144045752
125181553247119784977291356299000400621501899640861834921397448218205229901551601202847749
13167403958788702319729764025192728820514667011303350243539528119137202322243319055300521836651930159018
145380840530850146476452790010896193201001931958631399900282295314912714002150362536813484513303842821457014249032608

Computed in your browser ?

Technical details
Node id
n-2b0344b224ad4b43 · revision 1 · JSON
Definition source
derived:one_plus_derivative
Fingerprint
f6-9e9840ec713ff5b3

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:      5,      1;
  2:     21,     10,      1;
  3:     82,     66,     15,      1;
  4:    305,    358,    135,     20,      1;
  5:   1095,   1723,    940,    228,     25,     1;
  6:   3829,   7644,   5574,   1940,    345,    30,    1;
  7:  13124,  31972,  29574,  13690,   3470,   486,   35,   1;
  8:  44289, 127924, 144610,  84684,  28415,  5642,  651,  40,  1;
  9: 147625, 494517, 664380, 474900, 200949, 52605, 8568, 840, 45, 1;
%F Formula
The row polynomials satisfy (2*n^3+14*n-10*n*x-2*n*x^2)*P(n,x) = (4*n^3+12*n^2+36*n+28+(n^3+3*n^2-18*n-20)*x-(10*n+10)*x^2-(n+1)*x^3)*P(n-1,x) + (4*n^2+4*n+(8*n^2+8*n-28)*x+(n^2+n-60)*x^2-15*x^3-x^4)*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[((4*n^3 + 12*n^2 + 36*n + 28 + (n^3 + 3*n^2 - 18*n - 20)*x - (10*n + 10)*x^2 - (n + 1)*x^3)*P[n - 1, x] + (4*n^2 + 4*n + (8*n^2 + 8*n - 28)*x + (n^2 + n - 60)*x^2 - 15*x^3 - x^4)*D[P[n - 1, x], x])/(2*n^3 + 14*n - 10*n*x - 2*n*x^2)]];
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] = ((4*n^3 + 12*n^2 + 36*n + 28 + (n^3 + 3*n^2 - 18*n - 20)*x - (10*n + 10)*x^2 - (n + 1)*x^3)*v[i - 1] + (4*n^2 + 4*n + (8*n^2 + 8*n - 28)*x + (n^2 + n - 60)*x^2 - 15*x^3 - x^4)*deriv(v[i - 1], x))/(2*n^3 + 14*n - 10*n*x - 2*n*x^2)); 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-0bf9c5118214e49b
  • 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-0bf9c5118214e49b
  • 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-0bf9c5118214e49b
  • 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-0bf9c5118214e49b

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