A008277 → θ+1 → reverse → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(-1 + 20\,x + 190\,x^{2} - 4\,n x - 83\,n x^{2} + 9\,n^{2} x^{2}\right)\,P_{n-4}(x) + \left(-16\,x^{2} + 140\,x^{3} + 4\,n x^{2} - 50\,n x^{3} + 4\,n^{2} x^{3}\right)\,P_{n-4}'(x) + \left(17\,x^{4} - 4\,n x^{4}\right)\,P_{n-4}''(x) + \left(4 - 44\,x - 122\,x^{2} + 12\,n x + 103\,n x^{2} - 18\,n^{2} x^{2}\right)\,P_{n-3}(x) + \left(32\,x^{2} - 113\,x^{3} - 12\,n x^{2} + 72\,n x^{3} - 8\,n^{2} x^{3}\right)\,P_{n-3}'(x) + \left(-18\,x^{4} + 8\,n x^{4}\right)\,P_{n-3}''(x) + \left(-6 + 28\,x + 4\,x^{2} - 12\,n x - 20\,n x^{2} + 9\,n^{2} x^{2}\right)\,P_{n-2}(x) + \left(-16\,x^{2} + 5\,x^{3} + 12\,n x^{2} - 22\,n x^{3} + 4\,n^{2} x^{3}\right)\,P_{n-2}'(x) + \left(x^{4} - 4\,n x^{4}\right)\,P_{n-2}''(x) + \left(4 - 4\,x + 4\,n x\right)\,P_{n-1}(x) + \left(-4\,n x^{2}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 2 + 4\,x\)
\(P_{3}(x) = 3 + 24\,x + 9\,x^{2}\)
\(P_{4}(x) = 4 + 72\,x + 126\,x^{2} + 16\,x^{3}\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | ||||||||||||||
| 2 | 2 | 4 | 6 | |||||||||||||
| 3 | 3 | 24 | 9 | 36 | ||||||||||||
| 4 | 4 | 72 | 126 | 16 | 218 | |||||||||||
| 5 | 5 | 160 | 675 | 480 | 25 | 1345 | ||||||||||
| 6 | 6 | 300 | 2340 | 4320 | 1550 | 36 | 8552 | |||||||||
| 7 | 7 | 504 | 6300 | 22400 | 22575 | 4536 | 49 | 56371 | ||||||||
| 8 | 8 | 784 | 14364 | 84000 | 170100 | 104328 | 12446 | 64 | 386094 | |||||||
| 9 | 9 | 1152 | 29106 | 254016 | 868875 | 1118880 | 444675 | 32640 | 81 | 2749434 | ||||||
| 10 | 10 | 1620 | 54000 | 658560 | 3424050 | 7654500 | 6684580 | 1791360 | 82782 | 100 | 20351562 | |||||
| 11 | 11 | 2200 | 93555 | 1520640 | 11197725 | 38769192 | 60448850 | 37312000 | 6925743 | 204600 | 121 | 156474637 | ||||
| 12 | 12 | 2904 | 153450 | 3207600 | 31805400 | 158103792 | 389153688 | 441408000 | 198126324 | 25957800 | 495374 | 144 | 1248414488 | |||
| 13 | 13 | 3744 | 240669 | 6292000 | 80887950 | 547088256 | 1960390432 | 3579383808 | 3040942905 | 1013012000 | 94969875 | 1179360 | 169 | 10324391181 | ||
| 14 | 14 | 4732 | 363636 | 11627616 | 188188000 | 1663782120 | 8197629440 | 22099517440 | 30830077278 | 20037517500 | 5029604580 | 340835040 | 2768558 | 196 | 88401916150 | |
| 15 | 15 | 5880 | 532350 | 20442240 | 406856450 | 4558554000 | 29603664090 | 110913454080 | 231756335811 | 252415963800 | 127513986600 | 24397027200 | 1204176207 | 6422136 | 225 | 782797421084 |
Compute more
?
Technical details
- Node id
n-fc94df5213f0c4e4· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-b50e0bffdfcf6785
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 -1)
- 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 = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 1; 2: 2, 4; 3: 3, 24, 9; 4: 4, 72, 126, 16; 5: 5, 160, 675, 480, 25; 6: 6, 300, 2340, 4320, 1550, 36; 7: 7, 504, 6300, 22400, 22575, 4536, 49; 8: 8, 784, 14364, 84000, 170100, 104328, 12446, 64; 9: 9, 1152, 29106, 254016, 868875, 1118880, 444675, 32640, 81; 10: 10, 1620, 54000, 658560, 3424050, 7654500, 6684580, 1791360, 82782, 100;
%F FormulaThe row polynomials satisfy P(n,x) = -(1+(4*n-20)*x-(9*n^2-83*n+190)*x^2)*P(n-4,x) + ((4*n-16)*x^2+(4*n^2-50*n+140)*x^3)*d/dx P(n-4,x) - (4*n-17)*x^4*d^2/dx^2 P(n-4,x) + (4+(12*n-44)*x-(18*n^2-103*n+122)*x^2)*P(n-3,x) - ((12*n-32)*x^2+(8*n^2-72*n+113)*x^3)*d/dx P(n-3,x) + (8*n-18)*x^4*d^2/dx^2 P(n-3,x) - (6+(12*n-28)*x-(9*n^2-20*n+4)*x^2)*P(n-2,x) + ((12*n-16)*x^2+(4*n^2-22*n+5)*x^3)*d/dx P(n-2,x) - (4*n-1)*x^4*d^2/dx^2 P(n-2,x) + (4+(4*n-4)*x)*P(n-1,x) - 4*n*x^2*d/dx P(n-1,x) for n >= 5, with P(1,x) = 1, P(2,x) = 2 + 4*x, P(3,x) = 3 + 24*x + 9*x^2, P(4,x) = 4 + 72*x + 126*x^2 + 16*x^3.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 2 + 4*x;
P[3, x_] := 3 + 24*x + 9*x^2;
P[4, x_] := 4 + 72*x + 126*x^2 + 16*x^3;
P[n_, x_] := P[n, x] = Expand[-(1 + (4*n - 20)*x - (9*n^2 - 83*n + 190)*x^2)*P[n - 4, x] + ((4*n - 16)*x^2 + (4*n^2 - 50*n + 140)*x^3)*D[P[n - 4, x], x] - (4*n - 17)*x^4*D[P[n - 4, x], {x, 2}] + (4 + (12*n - 44)*x - (18*n^2 - 103*n + 122)*x^2)*P[n - 3, x] - ((12*n - 32)*x^2 + (8*n^2 - 72*n + 113)*x^3)*D[P[n - 3, x], x] + (8*n - 18)*x^4*D[P[n - 3, x], {x, 2}] - (6 + (12*n - 28)*x - (9*n^2 - 20*n + 4)*x^2)*P[n - 2, x] + ((12*n - 16)*x^2 + (4*n^2 - 22*n + 5)*x^3)*D[P[n - 2, x], x] - (4*n - 1)*x^4*D[P[n - 2, x], {x, 2}] + (4 + (4*n - 4)*x)*P[n - 1, x] - 4*n*x^2*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 2 + 4*x; v[3] = 3 + 24*x + 9*x^2; v[4] = 4 + 72*x + 126*x^2 + 16*x^3; for(n = 5, N, my(i = n); v[i] = -(1 + (4*n - 20)*x - (9*n^2 - 83*n + 190)*x^2)*v[i - 4] + ((4*n - 16)*x^2 + (4*n^2 - 50*n + 140)*x^3)*deriv(v[i - 4], x) - (4*n - 17)*x^4*deriv(deriv(v[i - 4], x), x) + (4 + (12*n - 44)*x - (18*n^2 - 103*n + 122)*x^2)*v[i - 3] - ((12*n - 32)*x^2 + (8*n^2 - 72*n + 113)*x^3)*deriv(v[i - 3], x) + (8*n - 18)*x^4*deriv(deriv(v[i - 3], x), x) - (6 + (12*n - 28)*x - (9*n^2 - 20*n + 4)*x^2)*v[i - 2] + ((12*n - 16)*x^2 + (4*n^2 - 22*n + 5)*x^3)*deriv(v[i - 2], x) - (4*n - 1)*x^4*deriv(deriv(v[i - 2], x), x) + (4 + (4*n - 4)*x)*v[i - 1] - 4*n*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, v[i])))};
T(10)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
derived from Laguerre’s theorem on multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on multiplier sequences
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
reversal of Triangle read by rows: T(n, k) = (k+1)*S2(n+1, k+1), for n >= k >= 0, and S2 = A048993 (Stirling2).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n, k) = (k+1)*S2(n+1, k+1), for n >= k >= 0, and S2 = A048993 (Stirling2).?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
- ↑ Liu–Wang theorem (above)
- ↑ Iterated real-rootedness preservers (above)
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.?
- ↑ Ray basis map theorem (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
Pólya–Schur theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k <= n).?
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
shift_x_plus_one of eulerian?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
shift_x_plus_one of eulerian?
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k <= n).?
-
-
from
Triangle read by rows: T(n, k) = (k+1)*S2(n+1, k+1), for n >= k >= 0, and S2 = A048993 (Stirling2).?
-
-
from
reversal of Triangle read by rows: T(n, k) = (k+1)*S2(n+1, k+1), for n >= k >= 0, and S2 = A048993 (Stirling2).?
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
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.