A059364 → basis A007318 → 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 + 2\,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 | 3 | 4 | |||||||||||||
| 2 | 2 | 11 | 15 | 28 | ||||||||||||
| 3 | 6 | 47 | 122 | 105 | 280 | |||||||||||
| 4 | 24 | 242 | 911 | 1518 | 945 | 3640 | ||||||||||
| 5 | 120 | 1474 | 7217 | 17611 | 21423 | 10395 | 58240 | |||||||||
| 6 | 720 | 10404 | 62464 | 199487 | 357481 | 340869 | 135135 | 1106560 | ||||||||
| 7 | 5040 | 83628 | 593308 | 2333369 | 5494672 | 7748298 | 6058980 | 2027025 | 24344320 | |||||||
| 8 | 40320 | 754704 | 6168140 | 28753188 | 83624649 | 155395808 | 180192906 | 119218860 | 34459425 | 608608000 | ||||||
| 9 | 362880 | 7558416 | 69852636 | 375973352 | 1298932413 | 2987430603 | 4574256506 | 4496634954 | 2575293165 | 654729075 | 17041024000 | |||||
| 10 | 3628800 | 83204640 | 857253096 | 5226638876 | 20884764522 | 57151886703 | 108478607723 | 141025736166 | 120182265684 | 60628447215 | 13749310575 | 528271744000 | ||||
| 11 | 39916800 | 998713440 | 11343490776 | 77209848844 | 349945103890 | 1109020337739 | 2507758079122 | 4046291075455 | 4565596854342 | 3431105030097 | 1545696702270 | 316234143225 | 17961239296000 | |||
| 12 | 479001600 | 12982481280 | 161089725312 | 1210105455528 | 6129587467780 | 22056871650118 | 57818605392939 | 111249444883510 | 155944439138479 | 155313181719714 | 104325986179665 | 42437227275450 | 7905853580625 | 664565853952000 | ||
| 13 | 6227020800 | 181705299840 | 2444693423616 | 20080793505288 | 112357484380396 | 452238193081594 | 1347177404661393 | 3007345129094983 | 5031012720654997 | 6229571219095215 | 5549693726767923 | 3368485581431805 | 1248581232985275 | 213458046676875 | 26582634158080000 | |
| 14 | 87178291200 | 2724457800960 | 39495161625984 | 352027218358896 | 2155347792978896 | 9589701750173800 | 31975391264625728 | 81170976542510159 | 157647186832924465 | 233113365966327923 | 258353277528512157 | 208099916216315037 | 115166219123316195 | 39197268410049225 | 6190283353629375 | 1143053268797440000 |
Compute more
?
Technical details
- Node id
n-fb5e52569298f703· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-e3fd51a9c1552ae1
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, 3; 2: 2, 11, 15; 3: 6, 47, 122, 105; 4: 24, 242, 911, 1518, 945; 5: 120, 1474, 7217, 17611, 21423, 10395; 6: 720, 10404, 62464, 199487, 357481, 340869, 135135; 7: 5040, 83628, 593308, 2333369, 5494672, 7748298, 6058980, 2027025; 8: 40320, 754704, 6168140, 28753188, 83624649, 155395808, 180192906, 119218860, 34459425; 9: 362880, 7558416, 69852636, 375973352, 1298932413, 2987430603, 4574256506, 4496634954, 2575293165, 654729075;
%F FormulaThe row polynomials satisfy P(n,x) = (n+(2*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 + (2*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 + (2*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
basis_map_A007318 of 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 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.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
- ↑ Liu–Wang theorem (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
-
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.?
- ↑ Liu–Wang theorem (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
-
-
from
basis_map_A007318 of Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
Related ?
Same fingerprint ?
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.