A225471 → basis A013610 → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(-16 + 48\,x + 81\,x^{2} + 32\,n - 48\,n x - 16\,n^{2}\right)\,P_{n-2}(x) + \left(-48\,x^{2} + 36\,x^{3} + 48\,n x^{2}\right)\,P_{n-2}'(x) + \left(-4 + 12\,x + 8\,n\right)\,P_{n-1}(x) + \left(-12\,x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 4 + 12\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 4 | 12 | 16 | ||||||
| 2 | 32 | 144 | 81 | 257 | |||||
| 3 | 384 | 2112 | 1944 | 432 | 4872 | ||||
| 4 | 6144 | 38400 | 45360 | 17280 | 2025 | 109209 | |||
| 5 | 122880 | 841728 | 1166400 | 587520 | 121500 | 8748 | 2848776 | ||
| 6 | 2949120 | 21676032 | 33675264 | 20321280 | 5670000 | 734832 | 35721 | 85062249 | |
| 7 | 82575360 | 642318336 | 1089220608 | 748597248 | 254016000 | 45069696 | 4000752 | 139968 | 2865937968 |
Compute more
?
Technical details
- Node id
n-798a623cf2a55ac8· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-63357bf49833c535
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: 4, 12; 2: 32, 144, 81; 3: 384, 2112, 1944, 432; 4: 6144, 38400, 45360, 17280, 2025; 5: 122880, 841728, 1166400, 587520, 121500, 8748; 6: 2949120, 21676032, 33675264, 20321280, 5670000, 734832, 35721; 7: 82575360, 642318336, 1089220608, 748597248, 254016000, 45069696, 4000752, 139968; 8: 2642411520, 21545091072, 39190708224, 29764288512, 11637561600, 2539579392, 312058656, 20155392, 531441; 9: 95126814720, 807332216832, 1556294860800, 1280531496960, 558472320000, 141699124224, 21604060800, 1948354560, 95659380, 1968300;
%F FormulaThe row polynomials satisfy P(n,x) = -(16*n^2-32*n+16+(48*n-48)*x-81*x^2)*P(n-2,x) + ((48*n-48)*x^2+36*x^3)*d/dx P(n-2,x) + (8*n-4+12*x)*P(n-1,x) - 12*x^2*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 4 + 12*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 4 + 12*x;
P[n_, x_] := P[n, x] = Expand[-(16*n^2 - 32*n + 16 + (48*n - 48)*x - 81*x^2)*P[n - 2, x] + ((48*n - 48)*x^2 + 36*x^3)*D[P[n - 2, x], x] + (8*n - 4 + 12*x)*P[n - 1, x] - 12*x^2*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 4 + 12*x; for(n = 2, N, my(i = n + 1); v[i] = -(16*n^2 - 32*n + 16 + (48*n - 48)*x - 81*x^2)*v[i - 2] + ((48*n - 48)*x^2 + 36*x^3)*deriv(v[i - 2], x) + (8*n - 4 + 12*x)*v[i - 1] - 12*x^2*deriv(v[i - 1], x)); 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, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order m; n >= 0, k >= 0.?
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A013610 of Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order…?
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.