A094638 → basis A013610 → θ+1
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(-9\,n x^{2} + 6\,n^{2} x + 18\,n^{2} x^{2} - n^{3} - 6\,n^{3} x - 9\,n^{3} x^{2}\right)\,P_{n-2}(x) + \left(-1 - 6\,n x + 2\,n^{2} + 6\,n^{2} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 2 + 6\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 2 | 6 | 8 | |||||||||||||
| 2 | 6 | 42 | 54 | 102 | ||||||||||||
| 3 | 24 | 276 | 783 | 648 | 1731 | |||||||||||
| 4 | 120 | 1956 | 8883 | 15768 | 9720 | 36447 | ||||||||||
| 5 | 720 | 15336 | 97308 | 272268 | 353970 | 174960 | 914562 | |||||||||
| 6 | 5040 | 133272 | 1095228 | 4241268 | 8603820 | 8870472 | 3674160 | 26623260 | ||||||||
| 7 | 40320 | 1277856 | 12959892 | 64596528 | 180163845 | 287780040 | 246719844 | 88179840 | 881718165 | |||||||
| 8 | 362880 | 13436064 | 162641844 | 996085296 | 3559370445 | 7778739096 | 10278319716 | 7560791424 | 2380855680 | 32730602445 | ||||||
| 9 | 3628800 | 153956160 | 2170579032 | 15815959344 | 69211583190 | 193110993378 | 347813478684 | 392767494048 | 253467596304 | 71425670400 | 1345940939340 | |||||
| 10 | 39916800 | 1911245760 | 30804396552 | 260798714064 | 1354425890490 | 4615837921998 | 10584833033754 | 16245475989408 | 16044046483464 | 9234602251200 | 2357047123200 | 60729822966690 | ||||
| 11 | 479001600 | 25569457920 | 464259423744 | 4484978017056 | 27011057641020 | 109025320327380 | 304727756401971 | 594145129145904 | 795641853908340 | 699096931408080 | 363500627196960 | 84853696435200 | 2982977658365175 | |||
| 12 | 6227020800 | 366891068160 | 7416123236352 | 80589166561440 | 552967760100780 | 2584206854348004 | 8540524286975583 | 20261257228006416 | 34406221831217532 | 40913934264638640 | 32409746637320448 | 15378759049029120 | 3309294160972800 | 158445290480496075 | ||
| 13 | 87178291200 | 5622182576640 | 125288852796288 | 1513886740150464 | 11670270511281120 | 62057787133588560 | 237148751890492344 | 664320969411572952 | 1370649766515826950 | 2063731359057700680 | 2208944232875483928 | 1594190029074223104 | 696082688075099520 | 138990354760857600 | 9049431094259941350 | |
| 14 | 1307674368000 | 91655715110400 | 2233530294272640 | 29724476858849088 | 254533111527116160 | 1519048440772396848 | 6598062847903224600 | 21347954631917226792 | 51948912302434226232 | 94919626156604101200 | 128478552281598030336 | 125122658924226428352 | 82976886644003644032 | 33569210751271211520 | 6254565964238592000 | 553022063027038798200 |
Compute more
?
Technical details
- Node id
n-25aab4bf90388489· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-1f228a2711e045ca
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: 2, 6; 2: 6, 42, 54; 3: 24, 276, 783, 648; 4: 120, 1956, 8883, 15768, 9720; 5: 720, 15336, 97308, 272268, 353970, 174960; 6: 5040, 133272, 1095228, 4241268, 8603820, 8870472, 3674160; 7: 40320, 1277856, 12959892, 64596528, 180163845, 287780040, 246719844, 88179840; 8: 362880, 13436064, 162641844, 996085296, 3559370445, 7778739096, 10278319716, 7560791424, 2380855680; 9: 3628800, 153956160, 2170579032, 15815959344, 69211583190, 193110993378, 347813478684, 392767494048, 253467596304, 71425670400;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = -(n^3+(6*n^3-6*n^2)*x+(9*n^3-18*n^2+9*n)*x^2)*P(n-2,x) + (2*n^2-1+(6*n^2-6*n)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 6*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 2 + 6*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^3 + (6*n^3 - 6*n^2)*x + (9*n^3 - 18*n^2 + 9*n)*x^2)*P[n - 2, x] + (2*n^2 - 1 + (6*n^2 - 6*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] = 2 + 6*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n^3 + (6*n^3 - 6*n^2)*x + (9*n^3 - 18*n^2 + 9*n)*x^2)*v[i - 2] + (2*n^2 - 1 + (6*n^2 - 6*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 Laguerre’s theorem on multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on multiplier sequences
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
basis_map_A013610 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 ›
-
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 ›
-
-
from
basis_map_A013610 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.