A060920 → D

nonnegative coefficients

Proved for all n: all roots real what this means

Recurrence
\(\left(6 - 10\,n + 4\,n^{2}\right)\,P_{n}(x) = \left(10 + 8\,x - 32\,n - 26\,n x + 16\,n^{2} + 12\,n^{2} x\right)\,P_{n-1}(x) + \left(5 + 9\,x + 4\,x^{2} - 10\,n - 18\,n x - 8\,n x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6Pn(1)
00
111
2527
32018341
471102424219
52354663158051101
67441884178276013565311
722857044858051801575210724881

Computed in your browser ?

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

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

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:     0;
  1:     1;
  2:     5,     2;
  3:    20,    18,      3;
  4:    71,   102,     42,      4;
  5:   235,   466,    315,     80,     5;
  6:   744,  1884,   1782,    760,   135,     6;
  7:  2285,  7044,   8580,   5180,  1575,   210,    7;
  8:  6865, 24946,  37206,  29140, 12670,  2940,  308,   8;
  9: 20284, 84894, 149889, 144488, 82035, 27468, 5082, 432, 9;
%F Formula
The row polynomials satisfy (4*n^2-10*n+6)*P(n,x) = (16*n^2-32*n+10+(12*n^2-26*n+8)*x)*P(n-1,x) - (10*n-5+(18*n-9)*x+(8*n-4)*x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 1.
%t Mathematica
P[0, x_] := 0;
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((16*n^2 - 32*n + 10 + (12*n^2 - 26*n + 8)*x)*P[n - 1, x] - (10*n - 5 + (18*n - 9)*x + (8*n - 4)*x^2)*D[P[n - 1, x], x])/(4*n^2 - 10*n + 6)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 1; for(n = 2, N, my(i = n + 1); v[i] = ((16*n^2 - 32*n + 10 + (12*n^2 - 26*n + 8)*x)*v[i - 1] - (10*n - 5 + (18*n - 9)*x + (8*n - 4)*x^2)*deriv(v[i - 1], x))/(4*n^2 - 10*n + 6)); 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, +inf)
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-2dfe8925c3432b87

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