A156992 → basis A007318 → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(4 - 2\,x + 6\,n x + n^{2} x^{2}\right)\,P_{n}(x) = \left(8 + 12\,x + 6\,x^{2} + x^{3} + 8\,n + 24\,n x + 16\,n x^{2} + 3\,n x^{3} + 12\,n^{2} x + 12\,n^{2} x^{2} + 3\,n^{2} x^{3} + 2\,n^{3} x^{2} + n^{3} x^{3}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 4 | 8 | 12 | |||||||||||||
| 2 | 24 | 96 | 54 | 174 | ||||||||||||
| 3 | 192 | 1152 | 1296 | 384 | 3024 | |||||||||||
| 4 | 1920 | 15360 | 25920 | 15360 | 3000 | 61560 | ||||||||||
| 5 | 23040 | 230400 | 518400 | 460800 | 180000 | 25920 | 1438560 | |||||||||
| 6 | 322560 | 3870720 | 10886400 | 12902400 | 7560000 | 2177280 | 246960 | 37966320 | ||||||||
| 7 | 5160960 | 72253440 | 243855360 | 361267200 | 282240000 | 121927680 | 27659520 | 2580480 | 1116944640 | |||||||
| 8 | 92897280 | 1486356480 | 5852528640 | 10404495360 | 10160640000 | 5852528640 | 1991485440 | 371589120 | 29393280 | 36241914240 | ||||||
| 9 | 1857945600 | 33443020800 | 150493593600 | 312134860800 | 365783040000 | 263363788800 | 119489126400 | 33443020800 | 5290790400 | 362880000 | 1285662067200 | |||||
| 10 | 40874803200 | 817496064000 | 4138573824000 | 9809952768000 | 13412044800000 | 11588006707200 | 6571901952000 | 2452488192000 | 581986944000 | 79833600000 | 4829932800 | 49497989587200 | ||||
| 11 | 980995276800 | 21581896089600 | 121398165504000 | 323728441344000 | 505825689600000 | 509872295116800 | 346996423065600 | 161864220672000 | 51214851072000 | 10538035200000 | 1275102259200 | 68976230400 | 2055345091430400 | |||
| 12 | 25505877196800 | 612141052723200 | 3787622763724800 | 11222585966592000 | 19727201894400000 | 22725736582348800 | 18043813999411200 | 10100327369932800 | 3994758383616000 | 1095955660800000 | 198915952435200 | 21520583884800 | 1052366515200 | 91557138453580800 | ||
| 13 | 714164561510400 | 18568278599270400 | 125335880545075200 | 408502129183948800 | 797855721062400000 | 1034021014496870400 | 938278327969382400 | 612753193775923200 | 290818410327244800 | 99731965132800000 | 24135135562137600 | 3916746267033600 | 383061411532800 | 17086945075200 | 4355031115840204800 | |
| 14 | 21424936845312000 | 599898231668736000 | 4386755819077632000 | 15597354023387136000 | 33509940284620800000 | 48254314009853952000 | 49259612218392576000 | 36765191626555392000 | 20357288722907136000 | 8377485071155200000 | 2534189234024448000 | 548344477384704000 | 80442896421888000 | 7176516931584000 | 294226732800000 | 220299712295959296000 |
Compute more
?
Technical details
- Node id
n-8b60a69ef260fa3b· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-e1337d43fda52a72
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, 8; 2: 24, 96, 54; 3: 192, 1152, 1296, 384; 4: 1920, 15360, 25920, 15360, 3000; 5: 23040, 230400, 518400, 460800, 180000, 25920; 6: 322560, 3870720, 10886400, 12902400, 7560000, 2177280, 246960; 7: 5160960, 72253440, 243855360, 361267200, 282240000, 121927680, 27659520, 2580480; 8: 92897280, 1486356480, 5852528640, 10404495360, 10160640000, 5852528640, 1991485440, 371589120, 29393280; 9: 1857945600, 33443020800, 150493593600, 312134860800, 365783040000, 263363788800, 119489126400, 33443020800, 5290790400, 362880000;
%F FormulaThe row polynomials satisfy (4+(6*n-2)*x+n^2*x^2)*P(n,x) = (8*n+8+(12*n^2+24*n+12)*x+(2*n^3+12*n^2+16*n+6)*x^2+(n^3+3*n^2+3*n+1)*x^3)*P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((8*n + 8 + (12*n^2 + 24*n + 12)*x + (2*n^3 + 12*n^2 + 16*n + 6)*x^2 + (n^3 + 3*n^2 + 3*n + 1)*x^3)*P[n - 1, x])/(4 + (6*n - 2)*x + n^2*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((8*n + 8 + (12*n^2 + 24*n + 12)*x + (2*n^3 + 12*n^2 + 16*n + 6)*x^2 + (n^3 + 3*n^2 + 3*n + 1)*x^3)*v[i - 1])/(4 + (6*n - 2)*x + n^2*x^2)); 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 Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
-
Geometric basis map (elementary) polytool ? step ›
-
from
theta_plus_one of Triangle read by rows: row n consists of n zeros followed by n!.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle read by rows: row n consists of n zeros followed by n!.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: row n consists of n zeros followed by n!.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
-
from
theta_plus_one of Triangle read by rows: row n consists of n zeros followed by n!.?
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (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)
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (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)
-
from
Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
-
-
from
basis_map_A007318 of Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
Related ?
Same fingerprint ?
- A356546 → x ↦ x+1 → (θ+1)²
- A178820 → basis A007318 → (θ+1)²
- basis-map coefficients of A113214, shifted → x ↦ x+1 → (θ+1)²
- A038208 → basis A007318 → (θ+1)²
- A178822 → x ↦ x+1 → (θ+1)²
- A038330 → basis A013609 → (θ+1)²
- A028326 → basis A007318 → (θ+1)²
- A027466 → basis A013611 → (θ+1)²
- A038325 → basis A007318 → (θ+1)²
- A178821 → basis A007318 → (θ+1)²
- A038221 → x ↦ x+1 → (θ+1)²
- A120910 → (θ+1)²
- A085880 → x ↦ x+1 → (θ+1)²
- A038338 → x ↦ x+1 → (θ+1)²
- A135065 → x ↦ x+1 → (θ+1)²
- A085881 → basis A007318 → (θ+1)²
- A120910 → D → (θ+1)²
- A196347 → x ↦ x+1 → (θ+1)²
- A038207 → (θ+1)²
- A003506 → x ↦ x+1 → (θ+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.