A059364 → basis A013610 → 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 + 3\,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 | 3 | 3 | 6 | |||||||||||||
| 2 | 18 | 33 | 15 | 66 | ||||||||||||
| 3 | 162 | 423 | 366 | 105 | 1056 | |||||||||||
| 4 | 1944 | 6534 | 8199 | 4554 | 945 | 22176 | ||||||||||
| 5 | 29160 | 119394 | 194859 | 158499 | 64269 | 10395 | 576576 | |||||||||
| 6 | 524880 | 2528172 | 5059584 | 5386149 | 3217329 | 1022607 | 135135 | 17873856 | ||||||||
| 7 | 11022480 | 60964812 | 144173844 | 189002889 | 148356144 | 69734682 | 18176940 | 2027025 | 643458816 | |||||||
| 8 | 264539520 | 1650537648 | 4496574060 | 6987024684 | 6773596569 | 4195686816 | 1621736154 | 357656580 | 34459425 | 26381811456 | ||||||
| 9 | 7142567040 | 49590767376 | 152767714932 | 274084573608 | 315640576359 | 241981878843 | 123504925662 | 40469714586 | 7725879495 | 654729075 | 1213563326976 | |||||
| 10 | 214277011200 | 1637716929120 | 5624437562856 | 11430659221812 | 15224993336538 | 13887908468829 | 8786767225563 | 3807694876482 | 1081640391156 | 181885341645 | 13749310575 | 61891729675776 | ||||
| 11 | 7071141369600 | 58973029918560 | 223273928944008 | 506573818265484 | 765329942207430 | 808475826211731 | 609385213226646 | 327749577111855 | 123271115067234 | 30879945270873 | 4637090106810 | 316234143225 | 3465936861843456 | |||
| 12 | 254561089305600 | 2299807611308160 | 9512187189948288 | 23818505681157624 | 40216223376104580 | 48238378298808066 | 42149763331452531 | 27033615106692930 | 12631499570216799 | 4193455906432278 | 938933875616985 | 127311681826350 | 7905853580625 | 211422148572450816 | ||
| 13 | 9927882482918400 | 96565646252269440 | 433070105913303552 | 1185750775693751112 | 2211532365059334468 | 2967134784808338234 | 2946276983994466491 | 2192354599110242607 | 1222536091119164271 | 504595268746712415 | 149841730622733921 | 30316370232886245 | 3745743698955825 | 213458046676875 | 13953861805781753856 | |
| 14 | 416971064282572800 | 4343665734599950080 | 20989348189674562944 | 62360565650623349712 | 127271131827610829904 | 188754099548670905400 | 209790542087209401408 | 177520925698469717733 | 114924799201201934985 | 56646547929817685289 | 20926615479809484717 | 5618697737840505999 | 1036495972109845755 | 117591805230147675 | 6190283353629375 | 990724188210504523776 |
Compute more
?
Technical details
- Node id
n-40fdee53f6f3666d· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-f8d027db0af7f231
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: 3, 3; 2: 18, 33, 15; 3: 162, 423, 366, 105; 4: 1944, 6534, 8199, 4554, 945; 5: 29160, 119394, 194859, 158499, 64269, 10395; 6: 524880, 2528172, 5059584, 5386149, 3217329, 1022607, 135135; 7: 11022480, 60964812, 144173844, 189002889, 148356144, 69734682, 18176940, 2027025; 8: 264539520, 1650537648, 4496574060, 6987024684, 6773596569, 4195686816, 1621736154, 357656580, 34459425; 9: 7142567040, 49590767376, 152767714932, 274084573608, 315640576359, 241981878843, 123504925662, 40469714586, 7725879495, 654729075;
%F FormulaThe row polynomials satisfy P(n,x) = (3*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[(3*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] = (3*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_A013610 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_A013610 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.