A059364 → basis A013609 → 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 + 2\,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 | 2 | 3 | 5 | |||||||||||||
| 2 | 8 | 22 | 15 | 45 | ||||||||||||
| 3 | 48 | 188 | 244 | 105 | 585 | |||||||||||
| 4 | 384 | 1936 | 3644 | 3036 | 945 | 9945 | ||||||||||
| 5 | 3840 | 23584 | 57736 | 70444 | 42846 | 10395 | 208845 | |||||||||
| 6 | 46080 | 332928 | 999424 | 1595896 | 1429924 | 681738 | 135135 | 5221125 | ||||||||
| 7 | 645120 | 5352192 | 18985856 | 37333904 | 43957376 | 30993192 | 12117960 | 2027025 | 151412625 | |||||||
| 8 | 10321920 | 96602112 | 394760960 | 920102016 | 1337994384 | 1243166464 | 720771624 | 238437720 | 34459425 | 4996616625 | ||||||
| 9 | 185794560 | 1934954496 | 8941137408 | 24062294528 | 41565837216 | 47798889648 | 36594052048 | 17986539816 | 5150586330 | 654729075 | 184874815125 | |||||
| 10 | 3715891200 | 42600775680 | 219456792576 | 669009776128 | 1336624929408 | 1828860374496 | 1735657723568 | 1128205889328 | 480729062736 | 121256894430 | 13749310575 | 7579867420125 | ||||
| 11 | 81749606400 | 1022682562560 | 5807867277312 | 19765721304064 | 44792973297920 | 70977301615296 | 80248258531904 | 64740657207280 | 36524774834736 | 13724420120388 | 3091393404540 | 316234143225 | 341094033905625 | |||
| 12 | 1961990553600 | 26588121661440 | 164955878719488 | 619573993230336 | 1569174391751680 | 2823279571215104 | 3700390745148096 | 3559982236272320 | 2495111026215664 | 1242505453757712 | 417303944718660 | 84874454550900 | 7905853580625 | 16713607661375625 | ||
| 13 | 51011754393600 | 744264908144640 | 5006732131565568 | 20562732549414912 | 57527032002762752 | 115772977428888064 | 172438707796658304 | 192470088262078912 | 160992407060959904 | 99673139505523440 | 44397549814143384 | 13473942325727220 | 2497162465970550 | 213458046676875 | 885821206052908125 | |
| 14 | 1428329123020800 | 22318758305464320 | 161772182020030464 | 720951743199019008 | 2207076140010389504 | 4909927296088985600 | 8185700163744186368 | 10389884997441300352 | 10089419957307165760 | 7459627710922493536 | 4133652440456194512 | 1664799329730520296 | 460664876493264780 | 78394536820098450 | 6190283353629375 | 50491808745015763125 |
Compute more
?
Technical details
- Node id
n-44ac5a9659d3e732· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-d47399ee7119df41
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: 2, 3; 2: 8, 22, 15; 3: 48, 188, 244, 105; 4: 384, 1936, 3644, 3036, 945; 5: 3840, 23584, 57736, 70444, 42846, 10395; 6: 46080, 332928, 999424, 1595896, 1429924, 681738, 135135; 7: 645120, 5352192, 18985856, 37333904, 43957376, 30993192, 12117960, 2027025; 8: 10321920, 96602112, 394760960, 920102016, 1337994384, 1243166464, 720771624, 238437720, 34459425; 9: 185794560, 1934954496, 8941137408, 24062294528, 41565837216, 47798889648, 36594052048, 17986539816, 5150586330, 654729075;
%F FormulaThe row polynomials satisfy P(n,x) = (2*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[(2*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] = (2*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_A013609 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.?
-
-
from
basis_map_A013609 of Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
Related ?
Candidate equalities ?
- A028338 → x ↦ x+1 → x ↦ x/(x+1) 15 rows; no all-index equality certificate was found
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.