A094638 → θ+1 → basis A013609
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-1 + n\right)\,P_{n}(x) = \left(-4\,n x^{2} + 4\,n^{2} x + 8\,n^{2} x^{2} - n^{3} - 4\,n^{3} x - 4\,n^{3} x^{2}\right)\,P_{n-2}(x) + \left(-1 - 4\,n x + 2\,n^{2} + 4\,n^{2} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 3 + 4\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 3 | 4 | 7 | |||||||||||||
| 2 | 13 | 36 | 24 | 73 | ||||||||||||
| 3 | 70 | 300 | 420 | 192 | 982 | |||||||||||
| 4 | 446 | 2620 | 5700 | 5440 | 1920 | 16126 | ||||||||||
| 5 | 3276 | 24640 | 73500 | 108640 | 79520 | 23040 | 312616 | |||||||||
| 6 | 27252 | 251104 | 958020 | 1936480 | 2186240 | 1306368 | 322560 | 6988024 | ||||||||
| 7 | 253296 | 2771888 | 12937344 | 33374880 | 51378320 | 47179776 | 23917824 | 5160960 | 176974288 | |||||||
| 8 | 2602224 | 33052464 | 182961408 | 576370592 | 1129902480 | 1411081728 | 1095949568 | 483803136 | 92897280 | 5008620880 | ||||||
| 9 | 29288160 | 424204704 | 2722030608 | 10154779712 | 24267363120 | 38516710848 | 40592211968 | 27383279616 | 10725986304 | 1857945600 | 156673800640 | |||||
| 10 | 358457760 | 5837778144 | 42668477808 | 184290059712 | 520810487120 | 1006100534208 | 1345237584768 | 1229038063616 | 734109640704 | 258792652800 | 40874803200 | 5368118539840 | ||||
| 11 | 4740577920 | 85825479168 | 704668412448 | 3463089398912 | 11317702487520 | 25822603270464 | 41966098061888 | 48571573180416 | 39228007762944 | 21050414161920 | 6753279836160 | 980995276800 | 199948997906560 | |||
| 12 | 67375532160 | 1343278969344 | 12250406611872 | 67569551384192 | 251022814305120 | 661643674156608 | 1268592166377536 | 1782500569614336 | 1821396576789504 | 1319735591116800 | 643523571744768 | 189566083399680 | 25505877196800 | 8044717537198720 | ||
| 13 | 1024208720640 | 22309433243136 | 223893572370624 | 1370654481923584 | 5710329820257920 | 17094923244512256 | 37830148445369280 | 62650318061247488 | 77637693736272384 | 71094421605109760 | 46753767910367232 | 20906593747992576 | 5696526963179520 | 714164561510400 | 347706769792076800 | |
| 14 | 16583626886400 | 391997187002880 | 4295399781771072 | 28918510597357056 | 133627854171194240 | 448290930628349952 | 1125886386001272896 | 2150319521170529280 | 3138050424973381632 | 3481811240316231680 | 2891014704092889088 | 1741713998754742272 | 719614581470134272 | 182484666081607680 | 21424936845312000 | 16067861735698662400 |
Compute more
?
Technical details
- Node id
n-33ade304648e36a9· revision 0 · JSON- Definition source
derived:basis_map_A013609- Fingerprint
f6-8e9f134e0951a759
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 ℚ): no
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 3, 4; 2: 13, 36, 24; 3: 70, 300, 420, 192; 4: 446, 2620, 5700, 5440, 1920; 5: 3276, 24640, 73500, 108640, 79520, 23040; 6: 27252, 251104, 958020, 1936480, 2186240, 1306368, 322560; 7: 253296, 2771888, 12937344, 33374880, 51378320, 47179776, 23917824, 5160960; 8: 2602224, 33052464, 182961408, 576370592, 1129902480, 1411081728, 1095949568, 483803136, 92897280; 9: 29288160, 424204704, 2722030608, 10154779712, 24267363120, 38516710848, 40592211968, 27383279616, 10725986304, 1857945600;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = -(n^3+(4*n^3-4*n^2)*x+(4*n^3-8*n^2+4*n)*x^2)*P(n-2,x) + (2*n^2-1+(4*n^2-4*n)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 4*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 3 + 4*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^3 + (4*n^3 - 4*n^2)*x + (4*n^3 - 8*n^2 + 4*n)*x^2)*P[n - 2, x] + (2*n^2 - 1 + (4*n^2 - 4*n)*x)*P[n - 1, x])/(n - 1)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 3 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n^3 + (4*n^3 - 4*n^2)*x + (4*n^3 - 8*n^2 + 4*n)*x^2)*v[i - 2] + (2*n^2 - 1 + (4*n^2 - 4*n)*x)*v[i - 1])/(n - 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
derived from Geometric basis map (elementary)
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Geometric basis map (elementary)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Geometric basis map (elementary) polytool ? step ›
-
from
theta_plus_one of Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the fir…?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] 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…?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
-
from
theta_plus_one of Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the fir…?
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.