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
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 5 | 1 | 6 | ||||||
| 2 | 21 | 10 | 1 | 32 | |||||
| 3 | 82 | 66 | 15 | 1 | 164 | ||||
| 4 | 305 | 358 | 135 | 20 | 1 | 819 | |||
| 5 | 1095 | 1723 | 940 | 228 | 25 | 1 | 4012 | ||
| 6 | 3829 | 7644 | 5574 | 1940 | 345 | 30 | 1 | 19363 | |
| 7 | 13124 | 31972 | 29574 | 13690 | 3470 | 486 | 35 | 1 | 92352 |
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 ExampleTriangle 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 FormulaThe 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 MathematicaP[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/GPP(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
-
preserver_image derivative_polynomial, shift 0
e-0bf9c5118214e49bLaguerre’s theorem on differential operators [SP14] polytool ?
-
premise (sequence):
Riordan array (1/((1-x)(1-3x)),x/((1-x)(1-3x))).
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check three_term_recurrence
e-894010de7c322dc8root: theorem checkThree-term recurrence criterion [Sze39, §3.3; Fav35] polytool ?
-
theorem_check three_term_recurrence
e-7bedda0241d23786root: theorem checkThree-term recurrence criterion [Sze39, §3.3; Fav35] polytool ?
-
-
premise (sequence):
Riordan array (1/((1-x)(1-3x)),x/((1-x)(1-3x))).
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