A008277 → θ+1 → reverse → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(8\right)\,P_{n}(x) = \left(-194 - 288\,x - 278\,x^{2} + 40\,x^{3} + 129\,n + 161\,n x + 82\,n x^{2} + 52\,n x^{3} - 18\,n^{2} - 21\,n^{2} x - 5\,n^{2} x^{2} - 27\,n^{2} x^{3} + 3\,n^{3} x^{3}\right)\,P_{n-4}(x) + \left(18 - 144\,x - 184\,x^{2} - 46\,x^{3} + 8\,x^{4} - 9\,n + 99\,n x + 21\,n x^{2} + 92\,n x^{3} + 12\,n x^{4} - 9\,n^{2} x + 3\,n^{2} x^{2} - 33\,n^{2} x^{3} - 3\,n^{2} x^{4} + 3\,n^{3} x^{3}\right)\,P_{n-4}'(x) + \left(-18\,x^{2} - 18\,x^{3} + 9\,n x^{2} + 12\,n x^{4} - 3\,n^{2} x^{4}\right)\,P_{n-4}''(x) + \left(104 + 82\,x + 242\,x^{2} - 88\,x^{3} - 72\,n - 171\,n x - 98\,n x^{2} - 12\,n x^{3} + 18\,n^{2} + 33\,n^{2} x + 10\,n^{2} x^{2} + 21\,n^{2} x^{3} - 3\,n^{3} x^{3}\right)\,P_{n-3}(x) + \left(-36 + 90\,x + 152\,x^{2} + 2\,x^{3} - 24\,x^{4} + 18\,n - 81\,n x - 15\,n x^{2} - 68\,n x^{3} - 12\,n x^{4} + 9\,n^{2} x - 6\,n^{2} x^{2} + 27\,n^{2} x^{3} + 3\,n^{2} x^{4} - 3\,n^{3} x^{3}\right)\,P_{n-3}'(x) + \left(18\,x^{2} + 18\,x^{3} - 8\,x^{4} - 9\,n x^{2} - 12\,n x^{4} + 3\,n^{2} x^{4}\right)\,P_{n-3}''(x) + \left(6 + 142\,x - 64\,x^{2} + 32\,x^{3} - 27\,n + 12\,n x + 16\,n x^{2} - 16\,n x^{3} - 12\,n^{2} x - 5\,n^{2} x^{2}\right)\,P_{n-2}(x) + \left(18 + 18\,x - 4\,x^{2} + 28\,x^{3} + 16\,x^{4} - 9\,n - 6\,n x^{2} + 3\,n^{2} x^{2}\right)\,P_{n-2}'(x) + \left(8\,x^{4}\right)\,P_{n-2}''(x) + \left(20 - 44\,x + 16\,x^{2} + 6\,n + 16\,n x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 3 + x\)
\(P_{3}(x) = 9 + 8\,x + x^{2}\)
\(P_{4}(x) = 22 + 46\,x + 17\,x^{2} + 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 | 3 | 1 | 4 | |||||||||||||
| 3 | 9 | 8 | 1 | 18 | ||||||||||||
| 4 | 22 | 46 | 17 | 1 | 86 | |||||||||||
| 5 | 45 | 190 | 165 | 34 | 1 | 435 | ||||||||||
| 6 | 81 | 595 | 1070 | 518 | 67 | 1 | 2332 | |||||||||
| 7 | 133 | 1526 | 4900 | 5012 | 1533 | 132 | 1 | 13237 | ||||||||
| 8 | 204 | 3388 | 17346 | 32466 | 21294 | 4422 | 261 | 1 | 79382 | |||||||
| 9 | 297 | 6756 | 50862 | 154896 | 190155 | 85530 | 12645 | 518 | 1 | 501660 | ||||||
| 10 | 415 | 12405 | 129480 | 589008 | 1200087 | 1031145 | 332350 | 36166 | 1031 | 1 | 3332088 | |||||
| 11 | 561 | 21340 | 295515 | 1886676 | 5832519 | 8478822 | 5314650 | 1267024 | 103917 | 2056 | 1 | 23203081 | ||||
| 12 | 738 | 34826 | 618475 | 5289339 | 23231076 | 52043244 | 56220912 | 26465032 | 4782206 | 300518 | 4105 | 1 | 168990472 | |||
| 13 | 949 | 54418 | 1206491 | 13335322 | 79219998 | 255244704 | 431503072 | 356267912 | 128713585 | 17978870 | 874965 | 8202 | 1 | 1284408489 | ||
| 14 | 1197 | 81991 | 2220582 | 30836806 | 238608370 | 1050007530 | 2584433280 | 3390250864 | 2183994813 | 616044975 | 67602990 | 2563494 | 16395 | 1 | 10166663288 | |
| 15 | 1485 | 119770 | 3892070 | 66374672 | 649406758 | 3751564960 | 12735315450 | 24622537368 | 25578626073 | 13062505638 | 2917496400 | 254927436 | 7551261 | 32780 | 1 | 83650352122 |
Compute more
?
Technical details
- Node id
n-d5c94734a249bbad· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-7469e0fa44e6298d
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: 3, 1; 3: 9, 8, 1; 4: 22, 46, 17, 1; 5: 45, 190, 165, 34, 1; 6: 81, 595, 1070, 518, 67, 1; 7: 133, 1526, 4900, 5012, 1533, 132, 1; 8: 204, 3388, 17346, 32466, 21294, 4422, 261, 1; 9: 297, 6756, 50862, 154896, 190155, 85530, 12645, 518, 1; 10: 415, 12405, 129480, 589008, 1200087, 1031145, 332350, 36166, 1031, 1;
%F FormulaThe row polynomials satisfy 8*P(n,x) = -(18*n^2-129*n+194+(21*n^2-161*n+288)*x+(5*n^2-82*n+278)*x^2-(3*n^3-27*n^2+52*n+40)*x^3)*P(n-4,x) - (9*n-18+(9*n^2-99*n+144)*x-(3*n^2+21*n-184)*x^2-(3*n^3-33*n^2+92*n-46)*x^3+(3*n^2-12*n-8)*x^4)*d/dx P(n-4,x) + ((9*n-18)*x^2-18*x^3-(3*n^2-12*n)*x^4)*d^2/dx^2 P(n-4,x) + (18*n^2-72*n+104+(33*n^2-171*n+82)*x+(10*n^2-98*n+242)*x^2-(3*n^3-21*n^2+12*n+88)*x^3)*P(n-3,x) + (18*n-36+(9*n^2-81*n+90)*x-(6*n^2+15*n-152)*x^2-(3*n^3-27*n^2+68*n-2)*x^3+(3*n^2-12*n-24)*x^4)*d/dx P(n-3,x) - ((9*n-18)*x^2-18*x^3-(3*n^2-12*n-8)*x^4)*d^2/dx^2 P(n-3,x) - (27*n-6+(12*n^2-12*n-142)*x+(5*n^2-16*n+64)*x^2+(16*n-32)*x^3)*P(n-2,x) - (9*n-18-18*x-(3*n^2-6*n-4)*x^2-28*x^3-16*x^4)*d/dx P(n-2,x) + 8*x^4*d^2/dx^2 P(n-2,x) + (6*n+20+(16*n-44)*x+16*x^2)*P(n-1,x) for n >= 5, with P(1,x) = 1, P(2,x) = 3 + x, P(3,x) = 9 + 8*x + x^2, P(4,x) = 22 + 46*x + 17*x^2 + x^3.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 3 + x;
P[3, x_] := 9 + 8*x + x^2;
P[4, x_] := 22 + 46*x + 17*x^2 + x^3;
P[n_, x_] := P[n, x] = Expand[Together[(-(18*n^2 - 129*n + 194 + (21*n^2 - 161*n + 288)*x + (5*n^2 - 82*n + 278)*x^2 - (3*n^3 - 27*n^2 + 52*n + 40)*x^3)*P[n - 4, x] - (9*n - 18 + (9*n^2 - 99*n + 144)*x - (3*n^2 + 21*n - 184)*x^2 - (3*n^3 - 33*n^2 + 92*n - 46)*x^3 + (3*n^2 - 12*n - 8)*x^4)*D[P[n - 4, x], x] + ((9*n - 18)*x^2 - 18*x^3 - (3*n^2 - 12*n)*x^4)*D[P[n - 4, x], {x, 2}] + (18*n^2 - 72*n + 104 + (33*n^2 - 171*n + 82)*x + (10*n^2 - 98*n + 242)*x^2 - (3*n^3 - 21*n^2 + 12*n + 88)*x^3)*P[n - 3, x] + (18*n - 36 + (9*n^2 - 81*n + 90)*x - (6*n^2 + 15*n - 152)*x^2 - (3*n^3 - 27*n^2 + 68*n - 2)*x^3 + (3*n^2 - 12*n - 24)*x^4)*D[P[n - 3, x], x] - ((9*n - 18)*x^2 - 18*x^3 - (3*n^2 - 12*n - 8)*x^4)*D[P[n - 3, x], {x, 2}] - (27*n - 6 + (12*n^2 - 12*n - 142)*x + (5*n^2 - 16*n + 64)*x^2 + (16*n - 32)*x^3)*P[n - 2, x] - (9*n - 18 - 18*x - (3*n^2 - 6*n - 4)*x^2 - 28*x^3 - 16*x^4)*D[P[n - 2, x], x] + 8*x^4*D[P[n - 2, x], {x, 2}] + (6*n + 20 + (16*n - 44)*x + 16*x^2)*P[n - 1, x])/(8)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 3 + x; v[3] = 9 + 8*x + x^2; v[4] = 22 + 46*x + 17*x^2 + x^3; for(n = 5, N, my(i = n); v[i] = (-(18*n^2 - 129*n + 194 + (21*n^2 - 161*n + 288)*x + (5*n^2 - 82*n + 278)*x^2 - (3*n^3 - 27*n^2 + 52*n + 40)*x^3)*v[i - 4] - (9*n - 18 + (9*n^2 - 99*n + 144)*x - (3*n^2 + 21*n - 184)*x^2 - (3*n^3 - 33*n^2 + 92*n - 46)*x^3 + (3*n^2 - 12*n - 8)*x^4)*deriv(v[i - 4], x) + ((9*n - 18)*x^2 - 18*x^3 - (3*n^2 - 12*n)*x^4)*deriv(deriv(v[i - 4], x), x) + (18*n^2 - 72*n + 104 + (33*n^2 - 171*n + 82)*x + (10*n^2 - 98*n + 242)*x^2 - (3*n^3 - 21*n^2 + 12*n + 88)*x^3)*v[i - 3] + (18*n - 36 + (9*n^2 - 81*n + 90)*x - (6*n^2 + 15*n - 152)*x^2 - (3*n^3 - 27*n^2 + 68*n - 2)*x^3 + (3*n^2 - 12*n - 24)*x^4)*deriv(v[i - 3], x) - ((9*n - 18)*x^2 - 18*x^3 - (3*n^2 - 12*n - 8)*x^4)*deriv(deriv(v[i - 3], x), x) - (27*n - 6 + (12*n^2 - 12*n - 142)*x + (5*n^2 - 16*n + 64)*x^2 + (16*n - 32)*x^3)*v[i - 2] - (9*n - 18 - 18*x - (3*n^2 - 6*n - 4)*x^2 - 28*x^3 - 16*x^4)*deriv(v[i - 2], x) + 8*x^4*deriv(deriv(v[i - 2], x), x) + (6*n + 20 + (16*n - 44)*x + 16*x^2)*v[i - 1])/(8)); 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 differential operators
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on differential operators
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] 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.