A133087 → D
nonnegative coefficients only rational roots
Proved for all n: all roots real, in (−∞, 0] · coefficients of one sign · Hadamard kernel what this means
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 0 | ||||||||||||||
| 1 | 1 | 1 | |||||||||||||
| 2 | 2 | 2 | 4 | ||||||||||||
| 3 | 5 | 8 | 3 | 16 | |||||||||||
| 4 | 4 | 12 | 12 | 4 | 32 | ||||||||||
| 5 | 9 | 32 | 42 | 24 | 5 | 112 | |||||||||
| 6 | 6 | 30 | 60 | 60 | 30 | 6 | 192 | ||||||||
| 7 | 13 | 72 | 165 | 200 | 135 | 48 | 7 | 640 | |||||||
| 8 | 8 | 56 | 168 | 280 | 280 | 168 | 56 | 8 | 1024 | ||||||
| 9 | 17 | 128 | 420 | 784 | 910 | 672 | 308 | 80 | 9 | 3328 | |||||
| 10 | 10 | 90 | 360 | 840 | 1260 | 1260 | 840 | 360 | 90 | 10 | 5120 | ||||
| 11 | 21 | 200 | 855 | 2160 | 3570 | 4032 | 3150 | 1680 | 585 | 120 | 11 | 16384 | |||
| 12 | 12 | 132 | 660 | 1980 | 3960 | 5544 | 5544 | 3960 | 1980 | 660 | 132 | 12 | 24576 | ||
| 13 | 25 | 288 | 1518 | 4840 | 10395 | 15840 | 17556 | 14256 | 8415 | 3520 | 990 | 168 | 13 | 77824 | |
| 14 | 14 | 182 | 1092 | 4004 | 10010 | 18018 | 24024 | 24024 | 18018 | 10010 | 4004 | 1092 | 182 | 14 | 114688 |
Computed in your browser ?
Technical details
- Node id
n-8366fe9539af19e0· revision 1 · JSON- Definition source
derived:derivative- Fingerprint
f6-851a5d9f63e111ec
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 -1)
- 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 ℚ): yes
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: 1; 2: 2, 2; 3: 5, 8, 3; 4: 4, 12, 12, 4; 5: 9, 32, 42, 24, 5; 6: 6, 30, 60, 60, 30, 6; 7: 13, 72, 165, 200, 135, 48, 7; 8: 8, 56, 168, 280, 280, 168, 56, 8; 9: 17, 128, 420, 784, 910, 672, 308, 80, 9;
%F FormulaThe row polynomials satisfy (n^2-3*n+2)*P(n,x) = -(3*n^3-15*n^2+22*n-8+(2*n^3-9*n^2+11*n-2)*x)*P(n-1,x) + (3*n^2-7*n+3+(5*n^2-11*n+4)*x+(2*n^2-4*n+1)*x^2)*d/dx P(n-1,x) for n >= 3, with P(0,x) = 0, P(1,x) = 1, P(2,x) = 2 + 2*x.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 1;
P[2, x_] := 2 + 2*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(3*n^3 - 15*n^2 + 22*n - 8 + (2*n^3 - 9*n^2 + 11*n - 2)*x)*P[n - 1, x] + (3*n^2 - 7*n + 3 + (5*n^2 - 11*n + 4)*x + (2*n^2 - 4*n + 1)*x^2)*D[P[n - 1, x], x])/(n^2 - 3*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] = 1; v[3] = 2 + 2*x; for(n = 3, N, my(i = n + 1); v[i] = (-(3*n^3 - 15*n^2 + 22*n - 8 + (2*n^3 - 9*n^2 + 11*n - 2)*x)*v[i - 1] + (3*n^2 - 7*n + 3 + (5*n^2 - 11*n + 4)*x + (2*n^2 - 4*n + 1)*x^2)*deriv(v[i - 1], x))/(n^2 - 3*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-14b2653a33368494 -
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-14b2653a33368494 -
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-14b2653a33368494
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-14b2653a33368494Laguerre’s theorem on differential operators [SP14] polytool ?
-
premise (sequence):
A133080 * A007318.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
basis_map A007318
e-3537980ff71b1a89Geometric basis map (elementary) polytool ?
-
premise (sequence):
Interpolation operator: Triangle with an even number of zeros in each line followed by 1 or 2 ones.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-4d02ac33f5b2fbc9root: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Interpolation operator: Triangle with an even number of zeros in each line followed by 1 or 2 ones.
-
parent_provers periodic_product
e-aa3a6b002de14e0croot: theorem checkParent-row provers of polytool polytool ?
-
preserver_image affine, shift 0
e-28a1cf3333f63fa4Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Interpolation operator: Triangle with an even number of zeros in each line followed by 1 or 2 ones.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
Interpolation operator: Triangle with an even number of zeros in each line followed by 1 or 2 ones.
-
-
premise (sequence):
A133080 * A007318.
Related sequences ?
No candidate equalities or related sequences.
References
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.