A225471 → basis A013609 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(-16 + 16\,x - 4\,x^{2} + 32\,n - 16\,n x - 16\,n^{2}\right)\,P_{n-2}(x) + \left(-4 + 4\,x + 8\,n\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 4 + 4\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 4 | 4 | 8 | ||||||
| 2 | 32 | 48 | 12 | 92 | |||||
| 3 | 384 | 704 | 288 | 32 | 1408 | ||||
| 4 | 6144 | 12800 | 6720 | 1280 | 80 | 27024 | |||
| 5 | 122880 | 280576 | 172800 | 43520 | 4800 | 192 | 624768 | ||
| 6 | 2949120 | 7225344 | 4988928 | 1505280 | 224000 | 16128 | 448 | 16909248 | |
| 7 | 82575360 | 214106112 | 161366016 | 55451648 | 10035200 | 989184 | 50176 | 1024 | 524574720 |
Compute more
?
Technical details
- Node id
n-b8a0748f602aaf4f· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-959faa625dfaa291
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, 4; 2: 32, 48, 12; 3: 384, 704, 288, 32; 4: 6144, 12800, 6720, 1280, 80; 5: 122880, 280576, 172800, 43520, 4800, 192; 6: 2949120, 7225344, 4988928, 1505280, 224000, 16128, 448; 7: 82575360, 214106112, 161366016, 55451648, 10035200, 989184, 50176, 1024; 8: 2642411520, 7181697024, 5806030848, 2204762112, 459755520, 55738368, 3913728, 147456, 2304; 9: 95126814720, 269110738944, 230562201600, 94854184960, 22063104000, 3109994496, 270950400, 14254080, 414720, 5120;
%F FormulaThe row polynomials satisfy P(n,x) = -(16*n^2-32*n+16+(16*n-16)*x+4*x^2)*P(n-2,x) + (8*n-4+4*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 4 + 4*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 4 + 4*x;
P[n_, x_] := P[n, x] = Expand[-(16*n^2 - 32*n + 16 + (16*n - 16)*x + 4*x^2)*P[n - 2, x] + (8*n - 4 + 4*x)*P[n - 1, 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 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = -(16*n^2 - 32*n + 16 + (16*n - 16)*x + 4*x^2)*v[i - 2] + (8*n - 4 + 4*x)*v[i - 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_A013609 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_A013609 of Triangle read by rows, s_4(n, k) where s_m(n, k) are the Stirling-Frobenius cycle numbers of order…?
Related ?
Same fingerprint ?
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.