A143494 → reverse
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 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | |||||||
| 2 | 1 | 2 | 3 | ||||||
| 3 | 1 | 5 | 4 | 10 | |||||
| 4 | 1 | 9 | 19 | 8 | 37 | ||||
| 5 | 1 | 14 | 55 | 65 | 16 | 151 | |||
| 6 | 1 | 20 | 125 | 285 | 211 | 32 | 674 | ||
| 7 | 1 | 27 | 245 | 910 | 1351 | 665 | 64 | 3263 | |
| 8 | 1 | 35 | 434 | 2380 | 5901 | 6069 | 2059 | 128 | 17007 |
Generated b-files: A005493 (row sums), A126351, A138378 (row sums), A143494 (reversed triangle) ?
Computed in your browser ?
Technical details
- Node id
n-c990ad92ffd076e4· revision 1 · JSON- Definition source
derived:reversal- Fingerprint
f6-b5f1389370a379f1
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 -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 ℚ): no
OEIS matches ?
- A005493: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 0 ?
- A126351: triangle, 55 terms agree, 10 full rows row-aligned (tabl) OEIS nonn in polytool catalog · view at the OEIS · generated b-file 990 terms from n = 1 ?
- A138378: row sums, 15 terms agree OEIS nonn (row-sum match: finite agreement only) · view at the OEIS · generated b-file 200 terms from n = 1 ?
- A143494: reversed triangle, 55 terms agree, 10 full rows row-aligned (tabl) OEIS nonn in polytool catalog · view at the OEIS · generated b-file 990 terms from n = 2 ?
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 = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 1; 2: 1, 2; 3: 1, 5, 4; 4: 1, 9, 19, 8; 5: 1, 14, 55, 65, 16; 6: 1, 20, 125, 285, 211, 32; 7: 1, 27, 245, 910, 1351, 665, 64; 8: 1, 35, 434, 2380, 5901, 6069, 2059, 128; 9: 1, 44, 714, 5418, 20181, 35574, 26335, 6305, 256; 10: 1, 54, 1110, 11130, 58107, 156660, 204205, 111645, 19171, 512;
%F FormulaThe row polynomials satisfy P(n,x) = (1+n*x)*P(n-1,x) - x^2*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t MathematicaP[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(1 + n*x)*P[n - 1, x] - x^2*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (1 + n*x)*v[i - 1] - x^2*deriv(v[i - 1], x)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)Generated with polytool c48629374597.
A126351: triangle, offset 1, from the row P1
%e ExampleTriangle begins: 1: 1; 2: 1, 2; 3: 1, 5, 4; 4: 1, 9, 19, 8; 5: 1, 14, 55, 65, 16; 6: 1, 20, 125, 285, 211, 32; 7: 1, 27, 245, 910, 1351, 665, 64; 8: 1, 35, 434, 2380, 5901, 6069, 2059, 128; 9: 1, 44, 714, 5418, 20181, 35574, 26335, 6305, 256; 10: 1, 54, 1110, 11130, 58107, 156660, 204205, 111645, 19171, 512;
%F FormulaThe row polynomials satisfy P(n,x) = (1+n*x)*P(n-1,x) - x^2*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t MathematicaP[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(1 + n*x)*P[n - 1, x] - x^2*D[P[n - 1, x], x]];
Table[PadRight[CoefficientList[P[n, x], x], n], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (1 + n*x)*v[i - 1] - x^2*deriv(v[i - 1], x)); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n - #c)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)Generated with polytool c48629374597.
A143494: reversed triangle, offset 2, from the row P1
%e ExampleTriangle begins: 2: 1; 3: 2, 1; 4: 4, 5, 1; 5: 8, 19, 9, 1; 6: 16, 65, 55, 14, 1; 7: 32, 211, 285, 125, 20, 1; 8: 64, 665, 1351, 910, 245, 27, 1; 9: 128, 2059, 6069, 5901, 2380, 434, 35, 1; 10: 256, 6305, 26335, 35574, 20181, 5418, 714, 44, 1; 11: 512, 19171, 111645, 204205, 156660, 58107, 11130, 1110, 54, 1;
%F FormulaRow n lists the coefficients of P(n,x) in descending powers of x, where P(n,x) = (1+(n-1)*x)*P(n-1,x) - x^2*d/dx P(n-1,x) for n >= 3, with P(2,x) = 1.
%t MathematicaP[2, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(1 + (n - 1)*x)*P[n - 1, x] - x^2*D[P[n - 1, x], x]];
Table[Reverse[PadRight[CoefficientList[P[n, x], x], n - 1]], {n, 2, 11}] // Flatten%o PARI/GPP(N) = {my(v = vector(N - 1)); v[1] = 1; for(n = 3, N, my(i = n - 1); v[i] = (1 + (n - 1)*x)*v[i - 1] - x^2*deriv(v[i - 1], x)); 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(11)Generated with polytool c48629374597.
Proved properties
-
Real-rooted. Every row P_n, n >= 1, 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-e104c7d9553deadb -
Coefficients of one sign. Every nonzero row, n >= 1: 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-e104c7d9553deadb -
Hadamard kernel (Malo). Rows P_n, n >= 1, 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-e104c7d9553deadb
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 reversal, shift 0
e-e104c7d9553deadbAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle read by rows: 2-Stirling numbers of the second kind.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-d198e25506383784root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
preserver_image derivative_polynomial, shift 0
e-34c9c7195bdd20aaLaguerre’s theorem on differential operators [SP14] polytool ?
-
premise (sequence):
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-995393ce4e49a8d6root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
basis_map A008277
e-c52960bc5e97caa0Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ?
-
premise (sequence):
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
parent_provers periodic_product
e-6e85c0971e84e272root: theorem checkParent-row provers of polytool polytool ?
-
preserver_image mobius, shift 0
e-ad67990681a86223Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
-
-
premise (sequence):
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…
-
preserver_image reversal, shift 0
e-d527982dc7c0aa3bAffine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
theorem_check liu_wang
e-8e580efc86a38a12root: theorem checkLiu–Wang theorem [LW07, Thm 2.1, Cor 2.4] ?
-
preserver_image reversal, shift 0
e-3256729839b26765Affine, reversal and Möbius substitutions (elementary) polytool ?
-
premise (sequence):
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.
uses: Every row P_n, n >= 1, is zero or real-rooted with all roots in (-inf, 0]
-
premise (sequence):
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.
-
-
premise (sequence):
Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.
-
-
premise (sequence):
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.
-
-
premise (sequence):
Triangle read by rows: 2-Stirling numbers of the second kind.
Related sequences ?
Same fingerprint (19)
Equal up to content, sign, reversal and a small index shift.
- A178821 → basis A008277
- A085881 → basis A008277
- A178820 → basis A008277
- A126351 → reverse
- A344565 → basis A008277
- A143494: Triangle read by rows: 2-Stirling numbers of the second kind.
- A178822 → basis A008277
- A135838 → basis A008277
- A126351: Triangle read by rows: matrix product of the Stirling numbers of the second kind with the binomial coefficient…
- A085880 → basis A008277
- A038208 → basis A008277
- basis-map coefficients of A113214, shifted → basis A008277
- A356546 → basis A008277
- A038325 → basis A008277
- A028326 → basis A008277
- A196347 → basis A008277
- A038338 → basis A008277
- A156992 → basis A008277
- A038221 → basis A008277
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
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.