A028421 → θ+1 → reverse
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(1 + 12\,x - x^{2} + 4\,n - 16\,n x + 2\,n x^{2} + 4\,n^{2} x - n^{2} x^{2}\right)\,P_{n-2}(x) + \left(-4\,x + 4\,x^{2} - 4\,n x^{2}\right)\,P_{n-2}'(x) + \left(8 - x - 4\,n + 2\,n x\right)\,P_{n-1}(x) + \left(4\,x\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 4 + x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 4 | 1 | 5 | |||||||||||||
| 2 | 9 | 12 | 2 | 23 | ||||||||||||
| 3 | 16 | 54 | 44 | 6 | 120 | |||||||||||
| 4 | 25 | 160 | 315 | 200 | 24 | 724 | ||||||||||
| 5 | 36 | 375 | 1360 | 2025 | 1096 | 120 | 5012 | |||||||||
| 6 | 49 | 756 | 4375 | 11760 | 14616 | 7056 | 720 | 39332 | ||||||||
| 7 | 64 | 1372 | 11592 | 49000 | 108304 | 118188 | 52272 | 5040 | 345832 | |||||||
| 8 | 81 | 2304 | 26754 | 163296 | 561225 | 1076544 | 1063116 | 438336 | 40320 | 3371976 | ||||||
| 9 | 100 | 3645 | 55680 | 463050 | 2277828 | 6733125 | 11578880 | 10554300 | 4106304 | 362880 | 36135792 | |||||
| 10 | 121 | 5500 | 106920 | 1161600 | 7730877 | 32473980 | 85423250 | 134552000 | 114782184 | 42514560 | 3628800 | 422379792 | ||||
| 11 | 144 | 7986 | 192500 | 2646270 | 22875072 | 129240342 | 480223260 | 1149893250 | 1684129216 | 1358261784 | 482175360 | 39916800 | 5349561984 | |||
| 12 | 169 | 11232 | 328757 | 5577000 | 60706503 | 443304576 | 2204521319 | 7418525400 | 16430170900 | 22624238208 | 17384035968 | 5945771520 | 479001600 | 72996193152 | ||
| 13 | 196 | 15379 | 537264 | 11022011 | 147447300 | 1350241893 | 8642334272 | 38756214497 | 120100276296 | 248942593900 | 325020049536 | 239370453504 | 79211036160 | 6227020800 | 1067779243008 | |
| 14 | 225 | 20580 | 845845 | 20638800 | 332719387 | 3731227500 | 29841340815 | 171613041600 | 706056823472 | 2039881203360 | 3993040142000 | 4975828166400 | 3529411180416 | 1133862589440 | 87178291200 | 16670798231040 |
Compute more
?
Technical details
- Node id
n-815236776f18362c· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-12b23884bf72db83
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, 1; 2: 9, 12, 2; 3: 16, 54, 44, 6; 4: 25, 160, 315, 200, 24; 5: 36, 375, 1360, 2025, 1096, 120; 6: 49, 756, 4375, 11760, 14616, 7056, 720; 7: 64, 1372, 11592, 49000, 108304, 118188, 52272, 5040; 8: 81, 2304, 26754, 163296, 561225, 1076544, 1063116, 438336, 40320; 9: 100, 3645, 55680, 463050, 2277828, 6733125, 11578880, 10554300, 4106304, 362880;
%F FormulaThe row polynomials satisfy P(n,x) = (4*n+1+(4*n^2-16*n+12)*x-(n^2-2*n+1)*x^2)*P(n-2,x) - (4*x+(4*n-4)*x^2)*d/dx P(n-2,x) - (4*n-8-(2*n-1)*x)*P(n-1,x) + 4*x*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 4 + x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 4 + x;
P[n_, x_] := P[n, x] = Expand[(4*n + 1 + (4*n^2 - 16*n + 12)*x - (n^2 - 2*n + 1)*x^2)*P[n - 2, x] - (4*x + (4*n - 4)*x^2)*D[P[n - 2, x], x] - (4*n - 8 - (2*n - 1)*x)*P[n - 1, x] + 4*x*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 + x; for(n = 2, N, my(i = n + 1); v[i] = (4*n + 1 + (4*n^2 - 16*n + 12)*x - (n^2 - 2*n + 1)*x^2)*v[i - 2] - (4*x + (4*n - 4)*x^2)*deriv(v[i - 2], x) - (4*n - 8 - (2*n - 1)*x)*v[i - 1] + 4*x*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
- Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
theta_plus_one_squared of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2).…?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
theta_plus_one of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n),…?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Liu–Wang theorem (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Liu–Wang theorem (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Parent-row provers of polytool (above)
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Liu–Wang theorem (above)
- ↑ Geometric basis map (elementary) (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)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
-
from
theta_plus_one of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n),…?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Liu–Wang theorem (above)
- ↑ Geometric basis map (elementary) (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)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Liu–Wang theorem (above)
- ↑ Geometric basis map (elementary) (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)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
-
from
theta_plus_one_squared of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2).…?
Related ?
Same fingerprint ?
- A225471 → basis A013611 → (θ+1)²
- A225470 → basis A013610 → (θ+1)²
- A028338 → basis A013609 → (θ+1)²
- A132393 → D → θ+1
- A028421 → θ+1
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.