A137320 → x ↦ x+1 → θ+1
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) = 1\)
\(P_{1}(x) = 2 + 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 | 2 | 4 | 6 | |||||||||||||
| 2 | 6 | 20 | 12 | 38 | ||||||||||||
| 3 | 24 | 104 | 108 | 32 | 268 | |||||||||||
| 4 | 120 | 616 | 852 | 448 | 80 | 2116 | ||||||||||
| 5 | 720 | 4176 | 6960 | 4960 | 1600 | 192 | 18608 | |||||||||
| 6 | 5040 | 32112 | 61248 | 53280 | 23600 | 5184 | 448 | 180912 | ||||||||
| 7 | 40320 | 277056 | 586320 | 589568 | 322000 | 98112 | 15680 | 1024 | 1930080 | |||||||
| 8 | 362880 | 2654784 | 6108048 | 6869632 | 4371920 | 1655808 | 370048 | 45056 | 2304 | 22440480 | ||||||
| 9 | 3628800 | 27999360 | 69044832 | 84984448 | 60893280 | 27050688 | 7564032 | 1296384 | 124416 | 5120 | 282591360 | |||||
| 10 | 39916800 | 322508160 | 843491232 | 1118948480 | 882287200 | 443701440 | 146322624 | 31549440 | 4285440 | 332800 | 11264 | 3833354880 | ||||
| 11 | 479001600 | 4029765120 | 11089419264 | 15676691712 | 13384817600 | 7441906560 | 2791174848 | 713044992 | 122411520 | 13516800 | 867328 | 24576 | 55742641920 | |||
| 12 | 6227020800 | 54302952960 | 156251745792 | 233368776960 | 213194358080 | 128868347520 | 53649721664 | 15649413120 | 3195700992 | 447744000 | 41012224 | 2211840 | 53248 | 865199059200 | ||
| 13 | 87178291200 | 785149424640 | 2350433299968 | 3683834199552 | 3568142955520 | 2315823324672 | 1051788914176 | 341719718912 | 79950993408 | 13369973760 | 1559207936 | 120446976 | 5537792 | 114688 | 14279076403200 | |
| 14 | 1307674368000 | 12125954534400 | 37611947773440 | 61525335126528 | 62731729831680 | 43300892963328 | 21180421470208 | 7529884730368 | 1968134268672 | 378218480640 | 52802061312 | 5208612864 | 344035328 | 13647872 | 245760 | 249718562150400 |
Compute more
?
Technical details
- Node id
n-385c0b04bd494306· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-713e6aebbd821571
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: 2, 4; 2: 6, 20, 12; 3: 24, 104, 108, 32; 4: 120, 616, 852, 448, 80; 5: 720, 4176, 6960, 4960, 1600, 192; 6: 5040, 32112, 61248, 53280, 23600, 5184, 448; 7: 40320, 277056, 586320, 589568, 322000, 98112, 15680, 1024; 8: 362880, 2654784, 6108048, 6869632, 4371920, 1655808, 370048, 45056, 2304; 9: 3628800, 27999360, 69044832, 84984448, 60893280, 27050688, 7564032, 1296384, 124416, 5120;
%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) = 1, P(1,x) = 2 + 4*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 2 + 4*x;
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] = 1; v[2] = 2 + 4*x; 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 multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on multiplier sequences
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] 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.