A108299 → D
Proved for all n: all roots real what this means
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | Pn(1) |
|---|---|---|---|---|---|---|---|---|
| 1 | 0 | |||||||
| 2 | -1 | -1 | ||||||
| 3 | -1 | -2 | -3 | |||||
| 4 | -1 | -4 | 3 | -2 | ||||
| 5 | -1 | -6 | 6 | 4 | 3 | |||
| 6 | -1 | -8 | 9 | 12 | -5 | 7 | ||
| 7 | -1 | -10 | 12 | 24 | -15 | -6 | 4 | |
| 8 | -1 | -12 | 15 | 40 | -30 | -24 | 7 | -5 |
Computed in your browser ?
Technical details
- Node id
n-86eb0721424572d8· revision 1 · JSON- Definition source
derived:derivative- Fingerprint
f6-0962ebe4daaf5d6e
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 -2)
- 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 ExampleTriangle begins: 1: 0; 2: -1; 3: -1, -2; 4: -1, -4, 3; 5: -1, -6, 6, 4; 6: -1, -8, 9, 12, -5; 7: -1, -10, 12, 24, -15, -6; 8: -1, -12, 15, 40, -30, -24, 7; 9: -1, -14, 18, 60, -50, -60, 28, 8; 10: -1, -16, 21, 84, -75, -120, 70, 40, -9;
%F FormulaThe row polynomials satisfy (4*n^2-14*n+12+(8*n^3-52*n^2+108*n-72)*x)*P(n,x) = (4*n^2-14*n+12+(8*n^3-40*n^2+62*n-30)*x-(12*n^2-52*n+48)*x^2-(16*n^3-96*n^2+176*n-96)*x^3)*P(n-1,x) - ((2*n-3)*x+(4*n^2-12*n+8)*x^2-(8*n-12)*x^3-(16*n^2-48*n+32)*x^4)*d/dx P(n-1,x) for n >= 3, with P(1,x) = 0, P(2,x) = -1.
%t MathematicaP[1, x_] := 0;
P[2, x_] := -1;
P[n_, x_] := P[n, x] = Expand[Together[((4*n^2 - 14*n + 12 + (8*n^3 - 40*n^2 + 62*n - 30)*x - (12*n^2 - 52*n + 48)*x^2 - (16*n^3 - 96*n^2 + 176*n - 96)*x^3)*P[n - 1, x] - ((2*n - 3)*x + (4*n^2 - 12*n + 8)*x^2 - (8*n - 12)*x^3 - (16*n^2 - 48*n + 32)*x^4)*D[P[n - 1, x], x])/(4*n^2 - 14*n + 12 + (8*n^3 - 52*n^2 + 108*n - 72)*x)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 0; v[2] = -1; for(n = 3, N, my(i = n); v[i] = ((4*n^2 - 14*n + 12 + (8*n^3 - 40*n^2 + 62*n - 30)*x - (12*n^2 - 52*n + 48)*x^2 - (16*n^3 - 96*n^2 + 176*n - 96)*x^3)*v[i - 1] - ((2*n - 3)*x + (4*n^2 - 12*n + 8)*x^2 - (8*n - 12)*x^3 - (16*n^2 - 48*n + 32)*x^4)*deriv(v[i - 1], x))/(4*n^2 - 14*n + 12 + (8*n^3 - 52*n^2 + 108*n - 72)*x)); 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-df27c1125e074e5e
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
-
preserver_image derivative_polynomial, shift 0
e-df27c1125e074e5eLaguerre’s theorem on differential operators [SP14] polytool ?
-
premise (sequence):
Triangle read by rows, 0 <= k <= n: T(n,k) = binomial(n-[(k+1)/2],[k/2])*(-1)^[(k+1)/2].
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, +inf)
-
theorem_check three_term_recurrence
e-7467667c9a732a94root: theorem checkThree-term recurrence criterion [Sze39, §3.3; Fav35] polytool ?
-
-
premise (sequence):
Triangle read by rows, 0 <= k <= n: T(n,k) = binomial(n-[(k+1)/2],[k/2])*(-1)^[(k+1)/2].
Related sequences ?
No candidate equalities or related sequences.
References
- [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.
- [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023