A136124 → basis A007318
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 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 3 | 1 | 4 | ||||||
| 2 | 12 | 7 | 1 | 20 | |||||
| 3 | 60 | 47 | 12 | 1 | 120 | ||||
| 4 | 360 | 342 | 119 | 18 | 1 | 840 | |||
| 5 | 2520 | 2754 | 1175 | 245 | 25 | 1 | 6720 | ||
| 6 | 20160 | 24552 | 12154 | 3135 | 445 | 33 | 1 | 60480 | |
| 7 | 181440 | 241128 | 133938 | 40369 | 7140 | 742 | 42 | 1 | 604800 |
Generated b-files: A001715 (row sums), A143492, A196845 (reversed triangle) ?
Computed in your browser ?
Technical details
- Node id
n-634bc9ca21d13c4b· revision 1 · JSON- Definition source
derived:basis_map_A007318- Fingerprint
f6-a7859c04dfd745fc
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 ℚ): yes
OEIS matches ?
- A143492: triangle, 46 terms agree, 9 full rows row-aligned (tabl) OEIS nonn · view at the OEIS · generated b-file 990 terms from n = 3 ?
- A196845: reversed triangle, 55 terms agree, 10 full rows row-aligned (tabl) OEIS nonn · view at the OEIS · generated b-file 990 terms from n = 0 ?
- A001715: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 3 ?
A generated b-file is computed from the node's definition along the row alignment of its OEIS link and starts at the entry's offset. It is an identification on a finite prefix, not a proof that the node and the OEIS entry agree for every n.
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: 12, 7, 1; 3: 60, 47, 12, 1; 4: 360, 342, 119, 18, 1; 5: 2520, 2754, 1175, 245, 25, 1; 6: 20160, 24552, 12154, 3135, 445, 33, 1; 7: 181440, 241128, 133938, 40369, 7140, 742, 42, 1; 8: 1814400, 2592720, 1580508, 537628, 111769, 14560, 1162, 52, 1; 9: 19958400, 30334320, 19978308, 7494416, 1767087, 271929, 27342, 1734, 63, 1;
%F FormulaThe row polynomials satisfy P(n,x) = (n+2+x)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(n + 2 + x)*P[n - 1, x]];
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] = (n + 2 + x)*v[i - 1]); 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.
A143492: triangle, offset 3, from the row P0
%e ExampleTriangle begins: 3: 1; 4: 3, 1; 5: 12, 7, 1; 6: 60, 47, 12, 1; 7: 360, 342, 119, 18, 1; 8: 2520, 2754, 1175, 245, 25, 1; 9: 20160, 24552, 12154, 3135, 445, 33, 1; 10: 181440, 241128, 133938, 40369, 7140, 742, 42, 1; 11: 1814400, 2592720, 1580508, 537628, 111769, 14560, 1162, 52, 1; 12: 19958400, 30334320, 19978308, 7494416, 1767087, 271929, 27342, 1734, 63, 1;
%F FormulaThe row polynomials satisfy P(n,x) = (n-1+x)*P(n-1,x) for n >= 4, with P(3,x) = 1.
%t MathematicaP[3, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(n - 1 + x)*P[n - 1, x]];
Table[PadRight[CoefficientList[P[n, x], x], n - 2], {n, 3, 12}] // Flatten%o PARI/GPP(N) = {my(v = vector(N - 2)); v[1] = 1; for(n = 4, N, my(i = n - 2); v[i] = (n - 1 + x)*v[i - 1]); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n - 2 - #c)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i + 2, v[i])))};
T(12)Generated with polytool c48629374597.
A196845: reversed triangle, offset 0, from the row P0
%e ExampleTriangle begins: 0: 1; 1: 1, 3; 2: 1, 7, 12; 3: 1, 12, 47, 60; 4: 1, 18, 119, 342, 360; 5: 1, 25, 245, 1175, 2754, 2520; 6: 1, 33, 445, 3135, 12154, 24552, 20160; 7: 1, 42, 742, 7140, 40369, 133938, 241128, 181440; 8: 1, 52, 1162, 14560, 111769, 537628, 1580508, 2592720, 1814400; 9: 1, 63, 1734, 27342, 271929, 1767087, 7494416, 19978308, 30334320, 19958400;
%F FormulaRow n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (n+2+x)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(n + 2 + x)*P[n - 1, x]];
Table[Reverse[PadRight[CoefficientList[P[n, x], x], n + 1]], {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] = (n + 2 + x)*v[i - 1]); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); c = Vecrev(c); 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-3fcdea1a6c83c49b -
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-3fcdea1a6c83c49b -
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-3fcdea1a6c83c49b
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
-
basis_map A007318
e-3fcdea1a6c83c49bGeometric basis map (elementary) polytool ?
-
premise (sequence):
Triangle read by rows: T(n,k) = (-1)^(n+k)*Sum_{j=1..k} s(n,j), where s(n,j) are the signed Stirling numbers of the fir…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-ab2b07f2d97ec943root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
basis_map A007318
e-ed30910ee779b0d9Geometric basis map (elementary) polytool ?
-
premise (sequence):
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-5f21311bb67f8c1croot: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
basis_map A007318
e-0b3ba9047fae59edGeometric basis map (elementary) polytool ?
-
premise (sequence):
Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers root_domain
e-edbf92ee2e446027root: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.
-
parent_provers root_domain
e-2e5c10abc86c264droot: theorem checkParent-row provers of polytool polytool ?
-
preserver_image reversal, shift 0
e-90e69a839bdbf74bAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-419a6747cb084155root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
preserver_image reversal, shift 0
e-986a227a8a459030Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-5f21311bb67f8c1c(expanded above) -
↵ basis_map A007318
e-0b3ba9047fae59ed(expanded above) -
↵ parent_provers root_domain
e-2e5c10abc86c264d(expanded above) -
preserver_image affine, shift 0
e-1ba7a8eebd893648Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
Triangle of unsigned Stirling numbers of the first kind (see A048994), read by rows, T(n,k) for 0 <= k <= n.
-
↵ theorem_check liu_wang
-
premise (sequence):
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…
-
parent_provers paper_theorem
e-b29f35705824bef6root: theorem checkParent-row provers of polytool polytool ?
-
-
premise (sequence):
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…
-
↵ preserver_image affine, shift 0
e-1ba7a8eebd893648(expanded above)
-
-
premise (sequence):
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…
-
parent_provers root_domain
e-f17aff623964d25aroot: theorem checkParent-row provers of polytool polytool ?
-
preserver_image affine, shift 0
e-ea4f969963775c13Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…
uses: Every row P_n, n >= 0, is zero or real-rooted with all roots in (-inf, 0]
-
↵ theorem_check liu_wang
e-5f21311bb67f8c1c(expanded above) -
↵ basis_map A007318
e-0b3ba9047fae59ed(expanded above) -
↵ parent_provers root_domain
e-2e5c10abc86c264d(expanded above) -
↵ preserver_image reversal, shift 0
e-90e69a839bdbf74b(expanded above) -
↵ preserver_image affine, shift 0
e-1ba7a8eebd893648(expanded above)
-
↵ theorem_check liu_wang
-
premise (sequence):
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…
-
-
premise (sequence):
Triangle read by rows: T(n,k) = (-1)^(n+k)*Sum_{j=1..k} s(n,j), where s(n,j) are the signed Stirling numbers of the fir…
Related sequences ?
Same fingerprint (1)
Equal up to content, sign, reversal and a small index shift.
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