A109692 → basis A007318 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-3 + 2\,n\right)\,P_{n}(x) = \left(4 + 12\,x + 9\,x^{2} - 16\,n - 44\,n x - 30\,n x^{2} + 20\,n^{2} + 48\,n^{2} x + 28\,n^{2} x^{2} - 8\,n^{3} - 16\,n^{3} x - 8\,n^{3} x^{2}\right)\,P_{n-2}(x) + \left(2 + 6\,x - 12\,n - 16\,n x + 8\,n^{2} + 8\,n^{2} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 3 + 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 | 1 | 4 | |||||||||||||
| 2 | 18 | 16 | 3 | 37 | ||||||||||||
| 3 | 148 | 236 | 113 | 15 | 512 | |||||||||||
| 4 | 1520 | 3624 | 3032 | 1016 | 105 | 9297 | ||||||||||
| 5 | 18656 | 60144 | 74132 | 42812 | 11139 | 945 | 207828 | |||||||||
| 6 | 266112 | 1089920 | 1800472 | 1517912 | 675154 | 144264 | 10395 | 5504229 | ||||||||
| 7 | 4324608 | 21578752 | 45029840 | 50574192 | 32638904 | 11861320 | 2156097 | 135135 | 168298848 | |||||||
| 8 | 78870528 | 465321472 | 1178403200 | 1665035712 | 1425388304 | 748370800 | 230569632 | 36530640 | 2027025 | 5830517313 | ||||||
| 9 | 1595142144 | 10881911808 | 32494291968 | 55556925568 | 59650641264 | 41410986864 | 18374822360 | 4922580744 | 691966755 | 34459425 | 225613728900 | |||||
| 10 | 35432939520 | 274723540992 | 946631523840 | 1904330787840 | 2468539625248 | 2144265315264 | 1254992757024 | 483063820496 | 114623175906 | 14491285920 | 654729075 | 9641749501125 | ||||
| 11 | 857558384640 | 7454067646464 | 29146656058368 | 67550437275648 | 102852580450624 | 107670283061952 | 78701488545840 | 39881219323664 | 13571721707244 | 2892718882836 | 332470354545 | 13749310575 | 450924951002400 | |||
| 12 | 22461642178560 | 216465068261376 | 947763278254080 | 2489441288077312 | 4361072576460032 | 5355027896263040 | 4710433028527232 | 2976562563686848 | 1331487988053088 | 406424960969304 | 78680065393368 | 8293035751560 | 316234143225 | 22904429626019025 | ||
| 13 | 633052460482560 | 6702124119883776 | 32503039649095680 | 95501060195827712 | 189412551053010432 | 267305176224016640 | 275484966297767232 | 209240426020995648 | 116573388086578288 | 46714977952784704 | 12936295200257868 | 2295076215196260 | 223453835093475 | 7905853580625 | 1255533493164570900 | |
| 14 | 19102786262138880 | 220466990854176768 | 1173663587497771008 | 3816598737488543744 | 8460465465723531264 | 13505834506199625728 | 15982500325144693632 | 14209170672810586752 | 9505689725039060704 | 4739427319047766336 | 1721258465001707928 | 436409574954063336 | 71482064133640770 | 6468075494458200 | 213458046676875 | 73868751753698441925 |
Compute more
?
Technical details
- Node id
n-8d7052a4e78ed776· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-ce6954f972870c7d
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, 1; 2: 18, 16, 3; 3: 148, 236, 113, 15; 4: 1520, 3624, 3032, 1016, 105; 5: 18656, 60144, 74132, 42812, 11139, 945; 6: 266112, 1089920, 1800472, 1517912, 675154, 144264, 10395; 7: 4324608, 21578752, 45029840, 50574192, 32638904, 11861320, 2156097, 135135; 8: 78870528, 465321472, 1178403200, 1665035712, 1425388304, 748370800, 230569632, 36530640, 2027025; 9: 1595142144, 10881911808, 32494291968, 55556925568, 59650641264, 41410986864, 18374822360, 4922580744, 691966755, 34459425;
%F FormulaThe row polynomials satisfy (2*n-3)*P(n,x) = -(8*n^3-20*n^2+16*n-4+(16*n^3-48*n^2+44*n-12)*x+(8*n^3-28*n^2+30*n-9)*x^2)*P(n-2,x) + (8*n^2-12*n+2+(8*n^2-16*n+6)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 3 + x;
P[n_, x_] := P[n, x] = Expand[Together[(-(8*n^3 - 20*n^2 + 16*n - 4 + (16*n^3 - 48*n^2 + 44*n - 12)*x + (8*n^3 - 28*n^2 + 30*n - 9)*x^2)*P[n - 2, x] + (8*n^2 - 12*n + 2 + (8*n^2 - 16*n + 6)*x)*P[n - 1, x])/(2*n - 3)]];
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 + x; for(n = 2, N, my(i = n + 1); v[i] = (-(8*n^3 - 20*n^2 + 16*n - 4 + (16*n^3 - 48*n^2 + 44*n - 12)*x + (8*n^3 - 28*n^2 + 30*n - 9)*x^2)*v[i - 2] + (8*n^2 - 12*n + 2 + (8*n^2 - 16*n + 6)*x)*v[i - 1])/(2*n - 3)); 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_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_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_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) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
basis_map_A007318 of Triangle of coefficients in expansion of (1+x)*(1+3x)*(1+5x)*(1+7x)*...*(1+(2n-1)x).?
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.