A130534 → D+1 → reverse
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(-1 + 2\,x - x^{2} - 2\,n x + 2\,n x^{2} - n^{2} x^{2}\right)\,P_{n-2}(x) + \left(2 - x + 2\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1 + 2\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 1 | 2 | 3 | |||||||||||||
| 2 | 1 | 5 | 5 | 11 | ||||||||||||
| 3 | 1 | 9 | 23 | 17 | 50 | |||||||||||
| 4 | 1 | 14 | 65 | 120 | 74 | 274 | ||||||||||
| 5 | 1 | 20 | 145 | 480 | 724 | 394 | 1764 | |||||||||
| 6 | 1 | 27 | 280 | 1435 | 3829 | 5012 | 2484 | 13068 | ||||||||
| 7 | 1 | 35 | 490 | 3570 | 14609 | 33439 | 39332 | 18108 | 109584 | |||||||
| 8 | 1 | 44 | 798 | 7812 | 45129 | 157080 | 319976 | 345832 | 149904 | 1026576 | ||||||
| 9 | 1 | 54 | 1230 | 15540 | 119973 | 585690 | 1800980 | 3343740 | 3371976 | 1389456 | 10628640 | |||||
| 10 | 1 | 65 | 1815 | 28710 | 284823 | 1848693 | 7927205 | 22077220 | 37982076 | 36135792 | 14257440 | 120543840 | ||||
| 11 | 1 | 77 | 2585 | 49995 | 618783 | 5139519 | 29164883 | 112693405 | 289240996 | 466692204 | 422379792 | 160460640 | 1486442880 | |||
| 12 | 1 | 90 | 3575 | 82940 | 1251393 | 12922338 | 93476669 | 476011536 | 1687557586 | 4042842232 | 6173604216 | 5349561984 | 1965444480 | 19802759040 | ||
| 13 | 1 | 104 | 4823 | 132132 | 2385383 | 29939910 | 268393697 | 1736198464 | 8081777704 | 26638297686 | 60144568120 | 87537976344 | 72996193152 | 26029779840 | 283465647360 | |
| 14 | 1 | 119 | 6370 | 203385 | 4326322 | 64809745 | 704222090 | 5628746695 | 33179499353 | 143119304328 | 443038439480 | 949875683120 | 1325124579024 | 1067779243008 | 370643938560 | 4339163001600 |
Compute more
?
Technical details
- Node id
n-0254a5a8457ca2c9· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-9dfcd5dbd8ed9f8f
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: 1, 2; 2: 1, 5, 5; 3: 1, 9, 23, 17; 4: 1, 14, 65, 120, 74; 5: 1, 20, 145, 480, 724, 394; 6: 1, 27, 280, 1435, 3829, 5012, 2484; 7: 1, 35, 490, 3570, 14609, 33439, 39332, 18108; 8: 1, 44, 798, 7812, 45129, 157080, 319976, 345832, 149904; 9: 1, 54, 1230, 15540, 119973, 585690, 1800980, 3343740, 3371976, 1389456;
%F FormulaThe row polynomials satisfy P(n,x) = -(1+(2*n-2)*x+(n^2-2*n+1)*x^2)*P(n-2,x) + (2+(2*n-1)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 2*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 1 + 2*x;
P[n_, x_] := P[n, x] = Expand[-(1 + (2*n - 2)*x + (n^2 - 2*n + 1)*x^2)*P[n - 2, x] + (2 + (2*n - 1)*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] = 1 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = -(1 + (2*n - 2)*x + (n^2 - 2*n + 1)*x^2)*v[i - 2] + (2 + (2*n - 1)*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
- 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
one_plus_derivative of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(…?
-
Geometric basis map (elementary) polytool ? step ›
-
Laguerre’s theorem on differential operators [SP14] 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 differential operators [SP14] 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
one_plus_derivative of Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(…?
Related ?
Same fingerprint ?
- A130534 → D+1
- A028338 → basis A013609 → D+1
- A225471 → basis A013611 → D+1
- A225470 → basis A013610 → D+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.