A008292 → γ (shift +1) → D
nonnegative coefficients
Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · Hadamard kernel what this means
Rows ?
| n | x0 | x1 | x2 | Pn(1) |
|---|---|---|---|---|
| 0 | 0 | |||
| 1 | 0 | |||
| 2 | 2 | 2 | ||
| 3 | 8 | 8 | ||
| 4 | 22 | 32 | 54 | |
| 5 | 52 | 272 | 324 | |
| 6 | 114 | 1440 | 816 | 2370 |
| 7 | 240 | 6144 | 11904 | 18288 |
Computed in your browser ?
Technical details
- Node id
n-1c856a64bff0746c· revision 1 · JSON- Definition source
derived:derivative- Fingerprint
f6-711fe341bb4ecef1
Observed on the stored rows ?
- Degrees: -1, -1, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6 (half affine: slope 1, intercept -2)
- 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: 0; 1: 0; 2: 2; 3: 8; 4: 22, 32; 5: 52, 272; 6: 114, 1440, 816; 7: 240, 6144, 11904; 8: 494, 23232, 102912, 31744; 9: 1004, 81552, 690432, 707584;
%F FormulaThe row polynomials satisfy (n-2)*P(n,x) = -(2*n-2+(4*n^2-20*n+16)*x+(4*n^3-28*n^2+56*n-32)*x^2)*P(n-2,x) - ((n-1)*x+(2*n^2-10*n+8)*x^2-(8*n^2-24*n+16)*x^3)*d/dx P(n-2,x) + (3*n-5+(4*n^2-20*n+24)*x)*P(n-1,x) + ((n-2)*x-(4*n-8)*x^2)*d/dx P(n-1,x) for n >= 3, with P(0,x) = 0, P(1,x) = 0, P(2,x) = 2.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 0;
P[2, x_] := 2;
P[n_, x_] := P[n, x] = Expand[Together[(-(2*n - 2 + (4*n^2 - 20*n + 16)*x + (4*n^3 - 28*n^2 + 56*n - 32)*x^2)*P[n - 2, x] - ((n - 1)*x + (2*n^2 - 10*n + 8)*x^2 - (8*n^2 - 24*n + 16)*x^3)*D[P[n - 2, x], x] + (3*n - 5 + (4*n^2 - 20*n + 24)*x)*P[n - 1, x] + ((n - 2)*x - (4*n - 8)*x^2)*D[P[n - 1, x], x])/(n - 2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 0; v[3] = 2; for(n = 3, N, my(i = n + 1); v[i] = (-(2*n - 2 + (4*n^2 - 20*n + 16)*x + (4*n^3 - 28*n^2 + 56*n - 32)*x^2)*v[i - 2] - ((n - 1)*x + (2*n^2 - 10*n + 8)*x^2 - (8*n^2 - 24*n + 16)*x^3)*deriv(v[i - 2], x) + (3*n - 5 + (4*n^2 - 20*n + 24)*x)*v[i - 1] + ((n - 2)*x - (4*n - 8)*x^2)*deriv(v[i - 1], x))/(n - 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-34f81fb2d053d311 -
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-34f81fb2d053d311 -
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-34f81fb2d053d311
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-34f81fb2d053d311Laguerre’s theorem on differential operators [SP14] polytool ?
-
premise (sequence):
Triangle T(n,k) (n >= 1, 0 <= k <= floor((n-1)/2)) read by rows, where T(n,k) = (k+1)T(n-1,k) + (2n-4k)T(n-1,k-1).
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
gamma_polynomial scale 1, shift 1
e-e49ea542bfed6bbfGamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ?
-
premise (sequence):
eulerian
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-ab3cdcfae289b48droot: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
parent_provers root_domain
e-6c46c948823f0a8croot: theorem checkParent-row provers of polytool polytool ?
-
preserver_image reversal, shift 0
e-c61ecf4ef1c45372Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
eulerian
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
eulerian
-
-
premise (sequence):
eulerian
-
-
premise (sequence):
Triangle T(n,k) (n >= 1, 0 <= k <= floor((n-1)/2)) read by rows, where T(n,k) = (k+1)T(n-1,k) + (2n-4k)T(n-1,k-1).
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.