A088996 → basis A013609 → D+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 - 12\,n x - 4\,n x^{2} + 12\,n^{2} + 20\,n^{2} x + 8\,n^{2} x^{2} - 4\,n^{3} - 8\,n^{3} x - 4\,n^{3} x^{2}\right)\,P_{n-2}(x) + \left(1 - 6\,n - 4\,n x + 4\,n^{2} + 4\,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 | 26 | 8 | 47 | ||||||||||||
| 3 | 83 | 268 | 244 | 48 | 643 | |||||||||||
| 4 | 701 | 3084 | 4652 | 2672 | 384 | 11493 | ||||||||||
| 5 | 7359 | 40726 | 85148 | 81928 | 34016 | 3840 | 253017 | |||||||||
| 6 | 92289 | 613262 | 1631212 | 2194952 | 1535104 | 496512 | 46080 | 6609411 | ||||||||
| 7 | 1345287 | 10410968 | 33511000 | 57743808 | 56774896 | 31026560 | 8195328 | 645120 | 199652967 | |||||||
| 8 | 22341465 | 197051544 | 742847016 | 1556522944 | 1967952144 | 1516990848 | 678226688 | 151123968 | 10321920 | 6843378537 | ||||||
| 9 | 416291355 | 4117682538 | 17765961000 | 43759007120 | 67495234992 | 67092083616 | 42406644736 | 16011062784 | 3081498624 | 185794560 | 262331261325 | |||||
| 10 | 8598724245 | 94198433922 | 457265415840 | 1292727259920 | 2349887916688 | 2856175566624 | 2332621321344 | 1247068729856 | 406956681216 | 68875960320 | 3715891200 | 11118091901175 | ||||
| 11 | 194977248795 | 2342106939492 | 12623738105196 | 40244125047536 | 84138392538064 | 120746578585792 | 120781994371648 | 83557053098240 | 38654673781760 | 11097217216512 | 1675054448640 | 81749606400 | 516137660988075 | |||
| 12 | 4814460176085 | 62897384096676 | 372487090982580 | 1320930979454512 | 3119420182592432 | 5156681381954240 | 6098858628688832 | 5174267656584448 | 3100886984332288 | 1263087273160704 | 323478876192768 | 44043538268160 | 1961990553600 | 26043816427037325 | ||
| 13 | 128583592125975 | 1814564443849470 | 11706698315907684 | 45683097288815704 | 120171971787855984 | 224674491894294304 | 306448712203493568 | 307736557730584704 | 226393310817144320 | 119565008361101312 | 43474791423270912 | 10044530179964928 | 1245193513205760 | 51011754393600 | 1419138523306008225 | |
| 14 | 3693120887658825 | 55972557242732790 | 390603072831550308 | 1662588892633824984 | 4818212215133064752 | 10045101082663084576 | 15511136199465078464 | 17980083678247508096 | 15669991875848327168 | 10167075021468774400 | 4796440916666335232 | 1574177642503766016 | 331164209666064384 | 37671064861409280 | 1428329123020800 | 83045339879242200075 |
Compute more
?
Technical details
- Node id
n-93c4bc52c48c6619· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-7c9f7ca6f2f9d8f8
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, 26, 8; 3: 83, 268, 244, 48; 4: 701, 3084, 4652, 2672, 384; 5: 7359, 40726, 85148, 81928, 34016, 3840; 6: 92289, 613262, 1631212, 2194952, 1535104, 496512, 46080; 7: 1345287, 10410968, 33511000, 57743808, 56774896, 31026560, 8195328, 645120; 8: 22341465, 197051544, 742847016, 1556522944, 1967952144, 1516990848, 678226688, 151123968, 10321920; 9: 416291355, 4117682538, 17765961000, 43759007120, 67495234992, 67092083616, 42406644736, 16011062784, 3081498624, 185794560;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = -(4*n^3-12*n^2+9*n+(8*n^3-20*n^2+12*n)*x+(4*n^3-8*n^2+4*n)*x^2)*P(n-2,x) + (4*n^2-6*n+1+(4*n^2-4*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[(-(4*n^3 - 12*n^2 + 9*n + (8*n^3 - 20*n^2 + 12*n)*x + (4*n^3 - 8*n^2 + 4*n)*x^2)*P[n - 2, x] + (4*n^2 - 6*n + 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 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = (-(4*n^3 - 12*n^2 + 9*n + (8*n^3 - 20*n^2 + 12*n)*x + (4*n^3 - 8*n^2 + 4*n)*x^2)*v[i - 2] + (4*n^2 - 6*n + 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 Laguerre’s theorem on differential operators
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on differential operators
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
basis_map_A013609 of Triangle T(n, k) read by rows: T(n, k) = Sum_{j=0..n} binomial(j, n-k) * |Stirling1(n, n-j)|.?
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A007318 of Triangle of coefficients in expansion of (1+x)*(1+3x)*(1+5x)*(1+7x)*...*(1+(2n-1)x).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle of coefficients in expansion of (1+x)*(1+3x)*(1+5x)*(1+7x)*...*(1+(2n-1)x).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
-
from
Triangle of coefficients in expansion of (1+x)*(1+3x)*(1+5x)*(1+7x)*...*(1+(2n-1)x).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
basis_map_A007318 of Triangle of coefficients in expansion of (1+x)*(1+3x)*(1+5x)*(1+7x)*...*(1+(2n-1)x).?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
basis_map_A013609 of Triangle T(n, k) read by rows: T(n, k) = Sum_{j=0..n} binomial(j, n-k) * |Stirling1(n, n-j)|.?
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.