A094638 → θ+1 → basis A007318
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-1 + n\right)\,P_{n}(x) = \left(-n x^{2} + 2\,n^{2} x + 2\,n^{2} x^{2} - n^{3} - 2\,n^{3} x - n^{3} x^{2}\right)\,P_{n-2}(x) + \left(-1 - 2\,n x + 2\,n^{2} + 2\,n^{2} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 3 + 2\,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 | 2 | 5 | |||||||||||||
| 2 | 13 | 18 | 6 | 37 | ||||||||||||
| 3 | 70 | 150 | 105 | 24 | 349 | |||||||||||
| 4 | 446 | 1310 | 1425 | 680 | 120 | 3981 | ||||||||||
| 5 | 3276 | 12320 | 18375 | 13580 | 4970 | 720 | 53241 | |||||||||
| 6 | 27252 | 125552 | 239505 | 242060 | 136640 | 40824 | 5040 | 816873 | ||||||||
| 7 | 253296 | 1385944 | 3234336 | 4171860 | 3211145 | 1474368 | 373716 | 40320 | 14144985 | |||||||
| 8 | 2602224 | 16526232 | 45740352 | 72046324 | 70618905 | 44096304 | 17124212 | 3779712 | 362880 | 272897145 | ||||||
| 9 | 29288160 | 212102352 | 680507652 | 1269347464 | 1516710195 | 1203647214 | 634253312 | 213931872 | 41898384 | 3628800 | 5805315405 | |||||
| 10 | 358457760 | 2918889072 | 10667119452 | 23036257464 | 32550655445 | 31440641694 | 21019337262 | 9601859872 | 2867615784 | 505454400 | 39916800 | 135006205005 | ||||
| 11 | 4740577920 | 42912739584 | 176167103112 | 432886174864 | 707356405470 | 806956352202 | 655720282217 | 379465415472 | 153234405324 | 41114090160 | 6594999840 | 479001600 | 3407627547765 | |||
| 12 | 67375532160 | 671639484672 | 3062601652968 | 8446193923024 | 15688925894070 | 20676364817394 | 19821752599649 | 13925785700112 | 7114830378084 | 2577608576400 | 628440988032 | 92561564160 | 6227020800 | 92780308131525 | ||
| 13 | 1024208720640 | 11154716621568 | 55973393092656 | 171331810240448 | 356895613766120 | 534216351391008 | 591096069458895 | 489455609853496 | 303272241157314 | 138856292197480 | 45657976474968 | 10208297728512 | 1390753653120 | 87178291200 | 2710620512647425 | |
| 14 | 16583626886400 | 195998593501440 | 1073849945442768 | 3614813824669632 | 8351740885699640 | 14009091582135936 | 17591974781269889 | 16799371259144760 | 12258009472552272 | 6800412578742640 | 2823256546965712 | 850446288454464 | 175687153679232 | 22275960215040 | 1307674368000 | 84584820173727825 |
Compute more
?
Technical details
- Node id
n-d671506ece7c3beb· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-179acb9fd453bef3
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, 2; 2: 13, 18, 6; 3: 70, 150, 105, 24; 4: 446, 1310, 1425, 680, 120; 5: 3276, 12320, 18375, 13580, 4970, 720; 6: 27252, 125552, 239505, 242060, 136640, 40824, 5040; 7: 253296, 1385944, 3234336, 4171860, 3211145, 1474368, 373716, 40320; 8: 2602224, 16526232, 45740352, 72046324, 70618905, 44096304, 17124212, 3779712, 362880; 9: 29288160, 212102352, 680507652, 1269347464, 1516710195, 1203647214, 634253312, 213931872, 41898384, 3628800;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = -(n^3+(2*n^3-2*n^2)*x+(n^3-2*n^2+n)*x^2)*P(n-2,x) + (2*n^2-1+(2*n^2-2*n)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 2*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 3 + 2*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^3 + (2*n^3 - 2*n^2)*x + (n^3 - 2*n^2 + n)*x^2)*P[n - 2, x] + (2*n^2 - 1 + (2*n^2 - 2*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 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n^3 + (2*n^3 - 2*n^2)*x + (n^3 - 2*n^2 + n)*x^2)*v[i - 2] + (2*n^2 - 1 + (2*n^2 - 2*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 (−∞, -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)
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
- 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.