A113413 → 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 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 3 | 1 | 4 | |||||||||||||
| 2 | 6 | 6 | 1 | 13 | ||||||||||||
| 3 | 10 | 20 | 9 | 1 | 40 | |||||||||||
| 4 | 14 | 48 | 42 | 12 | 1 | 117 | ||||||||||
| 5 | 18 | 92 | 134 | 72 | 15 | 1 | 332 | |||||||||
| 6 | 22 | 152 | 330 | 288 | 110 | 18 | 1 | 921 | ||||||||
| 7 | 26 | 228 | 678 | 872 | 530 | 156 | 21 | 1 | 2512 | |||||||
| 8 | 30 | 320 | 1226 | 2160 | 1910 | 880 | 210 | 24 | 1 | 6761 | ||||||
| 9 | 34 | 428 | 2022 | 4616 | 5562 | 3684 | 1358 | 272 | 27 | 1 | 18004 | |||||
| 10 | 38 | 552 | 3114 | 8832 | 13790 | 12360 | 6482 | 1984 | 342 | 30 | 1 | 47525 | ||||
| 11 | 42 | 692 | 4550 | 15528 | 30210 | 34988 | 24654 | 10640 | 2778 | 420 | 33 | 1 | 124536 | |||
| 12 | 46 | 848 | 6378 | 25552 | 60070 | 86688 | 78610 | 45280 | 16542 | 3760 | 506 | 36 | 1 | 324317 | ||
| 13 | 50 | 1020 | 8646 | 39880 | 110570 | 193140 | 217870 | 160784 | 77922 | 24620 | 4950 | 600 | 39 | 1 | 840092 | |
| 14 | 54 | 1208 | 11402 | 59616 | 191182 | 394872 | 539154 | 493696 | 305190 | 127224 | 35354 | 6368 | 702 | 42 | 1 | 2166065 |
Computed in your browser ?
Technical details
- Node id
n-cc69020d4f98197e· revision 1 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-a9254ac097c2de67
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 ?
- A119915: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS
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: 3, 1; 2: 6, 6, 1; 3: 10, 20, 9, 1; 4: 14, 48, 42, 12, 1; 5: 18, 92, 134, 72, 15, 1; 6: 22, 152, 330, 288, 110, 18, 1; 7: 26, 228, 678, 872, 530, 156, 21, 1; 8: 30, 320, 1226, 2160, 1910, 880, 210, 24, 1; 9: 34, 428, 2022, 4616, 5562, 3684, 1358, 272, 27, 1;
%F FormulaThe row polynomials satisfy -(2*n^3-9*n^2+13*n-6-(2*n^3-5*n^2+18*n-15)*x-(3*n^2-8*n-11)*x^2-(n^2+2*n+3)*x^3-(n+1)*x^4)*P(n,x) = -(2*n^3-7*n^2+7*n-2+(6*n^3-33*n^2+24*n+3)*x+(5*n^2-50*n+93)*x^2+(3*n^2-6*n+1)*x^3+(n-13)*x^4-2*x^5)*P(n-1,x) + ((2*n^2-3*n+1)*x+(12*n^2-14*n-2)*x^2+(2*n^2+22*n-43)*x^3+(10*n+17)*x^4+(n+10)*x^5+x^6)*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[(-(2*n^3 - 7*n^2 + 7*n - 2 + (6*n^3 - 33*n^2 + 24*n + 3)*x + (5*n^2 - 50*n + 93)*x^2 + (3*n^2 - 6*n + 1)*x^3 + (n - 13)*x^4 - 2*x^5)*P[n - 1, x] + ((2*n^2 - 3*n + 1)*x + (12*n^2 - 14*n - 2)*x^2 + (2*n^2 + 22*n - 43)*x^3 + (10*n + 17)*x^4 + (n + 10)*x^5 + x^6)*D[P[n - 1, x], x])/(-2*n^3 + 9*n^2 - 13*n + 6 + (2*n^3 - 5*n^2 + 18*n - 15)*x + (3*n^2 - 8*n - 11)*x^2 + (n^2 + 2*n + 3)*x^3 + (n + 1)*x^4)]];
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] = (-(2*n^3 - 7*n^2 + 7*n - 2 + (6*n^3 - 33*n^2 + 24*n + 3)*x + (5*n^2 - 50*n + 93)*x^2 + (3*n^2 - 6*n + 1)*x^3 + (n - 13)*x^4 - 2*x^5)*v[i - 1] + ((2*n^2 - 3*n + 1)*x + (12*n^2 - 14*n - 2)*x^2 + (2*n^2 + 22*n - 43)*x^3 + (10*n + 17)*x^4 + (n + 10)*x^5 + x^6)*deriv(v[i - 1], x))/(-2*n^3 + 9*n^2 - 13*n + 6 + (2*n^3 - 5*n^2 + 18*n - 15)*x + (3*n^2 - 8*n - 11)*x^2 + (n^2 + 2*n + 3)*x^3 + (n + 1)*x^4)); 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-79715410c2bf252f -
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-79715410c2bf252f -
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-79715410c2bf252f -
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-79715410c2bf252f
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-79715410c2bf252fLaguerre’s theorem on differential operators [SP14] polytool ?
-
premise (sequence):
A Riordan array of coordination sequences.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang_derivative_lag
e-7fe1799d89540b32root: theorem checkLiu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ?
-
-
premise (sequence):
A Riordan array of coordination sequences.
Related sequences ?
No candidate equalities or related sequences.
References
- [LW07] Lily L. Liu and Yi Wang. A unified approach to polynomial sequences with only real zeros. Advances in Applied Mathematics, 38(4):542–560, May 2007. doi:10.1016/j.aam.2006.02.003
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.