A137320 → x ↦ x+1 → D
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(-4\,x^{2} - 4\,n x - n^{2}\right)\,P_{n-2}(x) + \left(1 + 4\,x + 2\,n\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 2\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 0 | ||||||||||||||
| 1 | 2 | 2 | |||||||||||||
| 2 | 10 | 8 | 18 | ||||||||||||
| 3 | 52 | 72 | 24 | 148 | |||||||||||
| 4 | 308 | 568 | 336 | 64 | 1276 | ||||||||||
| 5 | 2088 | 4640 | 3720 | 1280 | 160 | 11888 | |||||||||
| 6 | 16056 | 40832 | 39960 | 18880 | 4320 | 384 | 120432 | ||||||||
| 7 | 138528 | 390880 | 442176 | 257600 | 81760 | 13440 | 896 | 1325280 | |||||||
| 8 | 1327392 | 4072032 | 5152224 | 3497536 | 1379840 | 317184 | 39424 | 2048 | 15787680 | ||||||
| 9 | 13999680 | 46029888 | 63738336 | 48714624 | 22542240 | 6483456 | 1134336 | 110592 | 4608 | 202757760 | |||||
| 10 | 161254080 | 562327488 | 839211360 | 705829760 | 369751200 | 125419392 | 27605760 | 3809280 | 299520 | 10240 | 2795518080 | ||||
| 11 | 2014882560 | 7392946176 | 11757518784 | 10707854080 | 6201588800 | 2392435584 | 623914368 | 108810240 | 12165120 | 788480 | 22528 | 41212926720 | |||
| 12 | 27151476480 | 104167830528 | 175026582720 | 170555486464 | 107390289600 | 45985475712 | 13693236480 | 2840623104 | 402969600 | 37283840 | 2027520 | 49152 | 647253331200 | ||
| 13 | 392574712320 | 1566955533312 | 2762875649664 | 2854514364416 | 1929852770560 | 901533355008 | 299004754048 | 71067549696 | 12032976384 | 1417461760 | 110409728 | 5111808 | 106496 | 10791944755200 | |
| 14 | 6062977267200 | 25074631848960 | 46144001344896 | 50185383865344 | 36084077469440 | 18154646974464 | 6588649139072 | 1749452683264 | 340396632576 | 48001873920 | 4774561792 | 317571072 | 12673024 | 229376 | 190437324134400 |
Compute more
?
Technical details
- Node id
n-f770ce833b7841d5· revision 0 · JSON- Definition source
derived:derivative- Fingerprint
f6-8f92721e6baca82c
Observed on the stored rows ?
- Degrees: -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (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 = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 0; 1: 2; 2: 10, 8; 3: 52, 72, 24; 4: 308, 568, 336, 64; 5: 2088, 4640, 3720, 1280, 160; 6: 16056, 40832, 39960, 18880, 4320, 384; 7: 138528, 390880, 442176, 257600, 81760, 13440, 896; 8: 1327392, 4072032, 5152224, 3497536, 1379840, 317184, 39424, 2048; 9: 13999680, 46029888, 63738336, 48714624, 22542240, 6483456, 1134336, 110592, 4608;
%F FormulaThe row polynomials satisfy P(n,x) = -(n^2+4*n*x+4*x^2)*P(n-2,x) + (2*n+1+4*x)*P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 2.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 2;
P[n_, x_] := P[n, x] = Expand[-(n^2 + 4*n*x + 4*x^2)*P[n - 2, x] + (2*n + 1 + 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] = 0; v[2] = 2; for(n = 2, N, my(i = n + 1); v[i] = -(n^2 + 4*n*x + 4*x^2)*v[i - 2] + (2*n + 1 + 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 differential operators
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on differential operators
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
basis_map_A007318 of Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 1…?
-
Geometric basis map (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…?
-
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…?
-
Geometric basis map (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) (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
basis_map_A007318 of Coefficients of raising factorial polynomials, T(n,k) = [x^k] p(x, n) where p(x, n) = (m*x + n - 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.