A059364 → reverse
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(x + n + n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 1 | 2 | 3 | |||||||||||||
| 2 | 2 | 7 | 6 | 15 | ||||||||||||
| 3 | 6 | 29 | 46 | 24 | 105 | |||||||||||
| 4 | 24 | 146 | 329 | 326 | 120 | 945 | ||||||||||
| 5 | 120 | 874 | 2521 | 3604 | 2556 | 720 | 10395 | |||||||||
| 6 | 720 | 6084 | 21244 | 39271 | 40564 | 22212 | 5040 | 135135 | ||||||||
| 7 | 5040 | 48348 | 197380 | 444849 | 598116 | 479996 | 212976 | 40320 | 2027025 | |||||||
| 8 | 40320 | 432144 | 2014172 | 5335212 | 8788569 | 9223012 | 6023772 | 2239344 | 362880 | 34459425 | ||||||
| 9 | 362880 | 4292496 | 22448988 | 68158628 | 132449241 | 170892798 | 146444068 | 80391816 | 25659360 | 3628800 | 654729075 | |||||
| 10 | 3628800 | 46916640 | 271707336 | 928525148 | 2074237318 | 3165869631 | 3344261458 | 2414802908 | 1140903576 | 318540960 | 39916800 | 13749310575 | ||||
| 11 | 39916800 | 559628640 | 3551780376 | 13474264660 | 33958912274 | 59715413757 | 74777311610 | 66693969484 | 41527574232 | 17194793472 | 4261576320 | 479001600 | 316234143225 | |||
| 12 | 479001600 | 7234462080 | 49896536832 | 207864320808 | 582672387868 | 1158050824646 | 1673628118161 | 1772432684738 | 1365352494076 | 746195986680 | 274671230976 | 61148511360 | 6227020800 | 7905853580625 | ||
| 13 | 6227020800 | 100754029440 | 749937447936 | 3400787686152 | 10484841533596 | 23212074150550 | 37969877081137 | 46472418555848 | 42563640009320 | 28815482743904 | 14017469816208 | 4640327881344 | 937030429440 | 87178291200 | 213458046676875 | |
| 14 | 87178291200 | 1503961724160 | 12010434712704 | 58860089325168 | 197799596762624 | 482241661111640 | 879759391394168 | 1220162015998927 | 1292977238468200 | 1041871358554456 | 628476818585472 | 275226637581936 | 82723344232320 | 15275952518400 | 1307674368000 | 6190283353629375 |
Compute more
?
Technical details
- Node id
n-11442bd8c172894a· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-774e45ab36bcae1f
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
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 1, 2; 2: 2, 7, 6; 3: 6, 29, 46, 24; 4: 24, 146, 329, 326, 120; 5: 120, 874, 2521, 3604, 2556, 720; 6: 720, 6084, 21244, 39271, 40564, 22212, 5040; 7: 5040, 48348, 197380, 444849, 598116, 479996, 212976, 40320; 8: 40320, 432144, 2014172, 5335212, 8788569, 9223012, 6023772, 2239344, 362880; 9: 362880, 4292496, 22448988, 68158628, 132449241, 170892798, 146444068, 80391816, 25659360, 3628800;
%F FormulaThe row polynomials satisfy P(n,x) = (n+(n+1)*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 + (n + 1)*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 + (n + 1)*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)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
- Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
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…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
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…?
- ↑ Liu–Wang theorem (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Parent-row provers of polytool (above)
-
from
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…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Parent-row provers of polytool (above)
-
from
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…?
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
Related ?
Candidate equalities ?
- A130534 → x ↦ x/(x+1) 15 rows; no all-index equality certificate was found
Same fingerprint ?
- A088996 → reverse
- A028338 → basis A013609 → x ↦ x/(x+1)
- A059364: Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.
- A225470 → basis A013610 → x ↦ x/(x+1)
- A088996: Triangle T(n, k) read by rows: T(n, k) = Sum_{j=0..n} binomial(j, n-k) * |Stirling1(n, n-j)|.
- A225471 → basis A013611 → x ↦ x/(x+1)
References
- [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
- [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
- [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.