A059364 → basis A007318 → basis A013609
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(1 + 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 | 4 | 2 | 6 | |||||||||||||
| 2 | 28 | 30 | 8 | 66 | ||||||||||||
| 3 | 280 | 468 | 260 | 48 | 1056 | |||||||||||
| 4 | 3640 | 8324 | 7124 | 2704 | 384 | 22176 | ||||||||||
| 5 | 58240 | 169584 | 197224 | 114504 | 33184 | 3840 | 576576 | |||||||||
| 6 | 1106560 | 3920976 | 5782264 | 4542264 | 2004544 | 471168 | 46080 | 17873856 | ||||||||
| 7 | 24344320 | 101753312 | 182103472 | 180881504 | 107691664 | 38429312 | 7610112 | 645120 | 643458816 | |||||||
| 8 | 608608000 | 2933341920 | 6180639792 | 7435693152 | 5586395664 | 2683799424 | 805121792 | 137889792 | 10321920 | 26381811456 | ||||||
| 9 | 17041024000 | 93088517760 | 225858068736 | 319450924512 | 290261555328 | 175701505824 | 70851799808 | 18353106432 | 2771030016 | 185794560 | 1213563326976 | |||||
| 10 | 528271744000 | 3226564530560 | 8863370486016 | 14420140034592 | 15387126705408 | 11251977787104 | 5710435910528 | 1985982295552 | 452964059136 | 61180231680 | 3715891200 | 61891729675776 | ||||
| 11 | 17961239296000 | 121325172407040 | 372339016196864 | 685278911868480 | 840405388744896 | 721084032280512 | 441698332274240 | 193152988080384 | 59092388512768 | 12045337178112 | 1472305397760 | 81749606400 | 3465936861843456 | |||
| 12 | 664565853952000 | 4920101122164480 | 16688347737052928 | 34291456127858496 | 47541693268404672 | 46849838524256448 | 33648855068879168 | 17747420533555968 | 6822090088901632 | 1863894799896576 | 343563391991808 | 38360064983040 | 1961990553600 | 211422148572450816 | ||
| 13 | 26582634158080000 | 214082757089331200 | 795456538658393600 | 1805555286277715968 | 2793245590060507776 | 3110077565948779392 | 2564050004385834368 | 1584767053133097088 | 734316537428520448 | 251930134307305472 | 62203800476983296 | 10467050791108608 | 1075841311703040 | 51011754393600 | 13953861805781753856 | |
| 14 | 1143053268797440000 | 9949872311267481600 | 40198948360812198400 | 99911660392376807424 | 170665108388377881472 | 211944211857491731584 | 197336322035156700800 | 139938383407526537088 | 75949088597153097728 | 31393858823212707840 | 9728807181114834944 | 2191789597373202432 | 339338598554271744 | 32317062166609920 | 1428329123020800 | 990724188210504523776 |
Compute more
?
Technical details
- Node id
n-42c5fee8e0c9f6a5· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-5f874879722b2208
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: 4, 2; 2: 28, 30, 8; 3: 280, 468, 260, 48; 4: 3640, 8324, 7124, 2704, 384; 5: 58240, 169584, 197224, 114504, 33184, 3840; 6: 1106560, 3920976, 5782264, 4542264, 2004544, 471168, 46080; 7: 24344320, 101753312, 182103472, 180881504, 107691664, 38429312, 7610112, 645120; 8: 608608000, 2933341920, 6180639792, 7435693152, 5586395664, 2683799424, 805121792, 137889792, 10321920; 9: 17041024000, 93088517760, 225858068736, 319450924512, 290261555328, 175701505824, 70851799808, 18353106432, 2771030016, 185794560;
%F FormulaThe row polynomials satisfy P(n,x) = (3*n+1+2*n*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 + 1 + 2*n*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 + 1 + 2*n*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 (−∞, -1]
- 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)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
Proof chains ? JSON
-
Geometric basis map (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.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis_map_A013609 of Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the …?
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A013609 of Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the …?
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.