A053123 → D+1

Proved for all n: all roots real what this means

Recurrence
\(\left(-30 + 38\,x - 8\,x^{2} + 62\,n - 54\,n x + 8\,n x^{2} - 40\,n^{2} + 16\,n^{2} x + 8\,n^{3}\right)\,P_{n}(x) = \left(-18 + 102\,x - 128\,x^{2} + 32\,x^{3} + 42\,n - 206\,n x + 162\,n x^{2} - 24\,n x^{3} - 32\,n^{2} + 128\,n^{2} x - 48\,n^{2} x^{2} + 8\,n^{3} - 24\,n^{3} x\right)\,P_{n-1}(x) + \left(-6\,x + 35\,x^{2} - 48\,x^{3} + 16\,x^{4} + 10\,n x - 48\,n x^{2} + 32\,n x^{3} - 4\,n^{2} x + 16\,n^{2} x^{2}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9x10x11x12x13x14Pn(1)
111
2-1-2-3
3-3232
4-514-2-43
5-734-3905-7
6-962-132845-64
7-1198-305384-154-1475
8-13142-5821100-93025228-8-11
9-15194-9872496-32451980-378-4896
10-17254-15444900-86458294-382852875-107
11-19322-22778704-1946025662-190196864-693-11011-15
12-21398-321014364-3896465688-6770440040-11583858154-128
13-23482-436722400-71535147288-195636162656-7865018590-1001-208139
14-25574-577233396-122815299250-488376527136-361998145860-286001092273-14-19
15-27674-744948000-199870563178-10928611457376-1308150755820-25768642432-1092-3501510

Computed in your browser ?

Technical details
Node id
n-0de906cd6e92b6be · revision 1 · JSON
Definition source
derived:one_plus_derivative
Fingerprint
f6-8ba428bd17294bc6

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): no
  • 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 = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:   1;
   2:  -1,  -2;
   3:  -3,   2,     3;
   4:  -5,  14,    -2,   -4;
   5:  -7,  34,   -39,    0,     5;
   6:  -9,  62,  -132,   84,     5,   -6;
   7: -11,  98,  -305,  384,  -154,  -14,     7;
   8: -13, 142,  -582, 1100,  -930,  252,    28,  -8;
   9: -15, 194,  -987, 2496, -3245, 1980,  -378, -48,  9;
  10: -17, 254, -1544, 4900, -8645, 8294, -3828, 528, 75, -10;
%F Formula
The row polynomials satisfy (8*n^3-40*n^2+62*n-30+(16*n^2-54*n+38)*x+(8*n-8)*x^2)*P(n,x) = (8*n^3-32*n^2+42*n-18-(24*n^3-128*n^2+206*n-102)*x-(48*n^2-162*n+128)*x^2-(24*n-32)*x^3)*P(n-1,x) - ((4*n^2-10*n+6)*x-(16*n^2-48*n+35)*x^2-(32*n-48)*x^3-16*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[((8*n^3 - 32*n^2 + 42*n - 18 - (24*n^3 - 128*n^2 + 206*n - 102)*x - (48*n^2 - 162*n + 128)*x^2 - (24*n - 32)*x^3)*P[n - 1, x] - ((4*n^2 - 10*n + 6)*x - (16*n^2 - 48*n + 35)*x^2 - (32*n - 48)*x^3 - 16*x^4)*D[P[n - 1, x], x])/(8*n^3 - 40*n^2 + 62*n - 30 + (16*n^2 - 54*n + 38)*x + (8*n - 8)*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] = ((8*n^3 - 32*n^2 + 42*n - 18 - (24*n^3 - 128*n^2 + 206*n - 102)*x - (48*n^2 - 162*n + 128)*x^2 - (24*n - 32)*x^3)*v[i - 1] - ((4*n^2 - 10*n + 6)*x - (16*n^2 - 48*n + 35)*x^2 - (32*n - 48)*x^3 - 16*x^4)*deriv(v[i - 1], x))/(8*n^3 - 40*n^2 + 62*n - 30 + (16*n^2 - 54*n + 38)*x + (8*n - 8)*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, +inf)
    Every polynomial of the sequence has only real roots, inside the stated interval.
    by the cited steps: e-d32ce5c030354d3d

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