A156992 → basis A013609 → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(1 - x + 3\,n x + n^{2} x^{2}\right)\,P_{n}(x) = \left(2 + 6\,x + 6\,x^{2} + 2\,x^{3} + 2\,n + 12\,n x + 16\,n x^{2} + 6\,n x^{3} + 6\,n^{2} x + 12\,n^{2} x^{2} + 6\,n^{2} x^{3} + 2\,n^{3} x^{2} + 2\,n^{3} x^{3}\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 4 | 16 | 20 | ||||||
| 2 | 24 | 192 | 216 | 432 | |||||
| 3 | 192 | 2304 | 5184 | 3072 | 10752 | ||||
| 4 | 1920 | 30720 | 103680 | 122880 | 48000 | 307200 | |||
| 5 | 23040 | 460800 | 2073600 | 3686400 | 2880000 | 829440 | 9953280 | ||
| 6 | 322560 | 7741440 | 43545600 | 103219200 | 120960000 | 69672960 | 15805440 | 361267200 | |
| 7 | 5160960 | 144506880 | 975421440 | 2890137600 | 4515840000 | 3901685760 | 1770209280 | 330301440 | 14533263360 |
Compute more
?
Technical details
- Node id
n-e642c8ebc6bb8d51· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-d42e6339eab21b9c
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, 16; 2: 24, 192, 216; 3: 192, 2304, 5184, 3072; 4: 1920, 30720, 103680, 122880, 48000; 5: 23040, 460800, 2073600, 3686400, 2880000, 829440; 6: 322560, 7741440, 43545600, 103219200, 120960000, 69672960, 15805440; 7: 5160960, 144506880, 975421440, 2890137600, 4515840000, 3901685760, 1770209280, 330301440; 8: 92897280, 2972712960, 23410114560, 83235962880, 162570240000, 187280916480, 127455068160, 47563407360, 7524679680; 9: 1857945600, 66886041600, 601974374400, 2497078886400, 5852528640000, 8427641241600, 7647304089600, 4280706662400, 1354442342400, 185794560000;
%F FormulaThe row polynomials satisfy (1+(3*n-1)*x+n^2*x^2)*P(n,x) = (2*n+2+(6*n^2+12*n+6)*x+(2*n^3+12*n^2+16*n+6)*x^2+(2*n^3+6*n^2+6*n+2)*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[((2*n + 2 + (6*n^2 + 12*n + 6)*x + (2*n^3 + 12*n^2 + 16*n + 6)*x^2 + (2*n^3 + 6*n^2 + 6*n + 2)*x^3)*P[n - 1, x])/(1 + (3*n - 1)*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] = ((2*n + 2 + (6*n^2 + 12*n + 6)*x + (2*n^3 + 12*n^2 + 16*n + 6)*x^2 + (2*n^3 + 6*n^2 + 6*n + 2)*x^3)*v[i - 1])/(1 + (3*n - 1)*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_A013609 of 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
basis_map_A013609 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.?
-
-
from
basis_map_A013609 of Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
-
-
from
basis_map_A013609 of Triangle T(n,k) = n!*binomial(n-1, k-1) for 1 <= k <= n, read by rows.?
Related ?
Same fingerprint ?
- basis-map coefficients of A112227 → x ↦ x+1 → (θ+1)²
- basis-map coefficients of A026729 → basis A007318 → (θ+1)²
- A027465 → basis A013611 → (θ+1)²
- A038325 → basis A013609 → (θ+1)²
- A356546 → basis A013609 → (θ+1)²
- A038338 → basis A013609 → (θ+1)²
- A038208 → D → (θ+1)²
- A038221 → basis A013609 → (θ+1)²
- A038338 → (θ+1)²
- A135065 → (θ+1)²
- A125092: Triangle read by rows: T(n,k) = (k+1)^2*binomial(n,k) (0 <= k <= n).
- A356546 → (θ+1)²
- A038221 → (θ+1)²
- basis-map coefficients of A113214, shifted → basis A013609 → (θ+1)²
- A028326 → D → (θ+1)²
- A120910 → basis A013610 → (θ+1)²
- basis-map coefficients of A127647 → (θ+1)²
- A038325 → (θ+1)²
- A038208 → (θ+1)²
- A003506 → (θ+1)²
- A156992 → (θ+1)²
- A131431 → x ↦ x+1 → (θ+1)²
- A028326 → (θ+1)²
- A135838 → (θ+1)²
- A085881 → basis A013609 → (θ+1)²
- A196347 → (θ+1)²
- A376827 → (θ+1)²
- A344565 → (θ+1)²
- A085880 → basis A013609 → (θ+1)²
- A196347 → basis A013609 → (θ+1)²
- A085881 → (θ+1)²
- A124860 → (θ+1)²
- A178821 → basis A013609 → (θ+1)²
- A178820 → (θ+1)²
- basis-map coefficients of A113214, shifted → (θ+1)²
- A178822 → basis A013609 → (θ+1)²
- basis-map coefficients of A113214, shifted → D → (θ+1)²
- A178821 → (θ+1)²
- A085880 → (θ+1)²
- A178822 → (θ+1)²
- A125092 → reverse
- A038330 → basis A013611 → (θ+1)²
- basis-map coefficients of A026729, shifted → basis A007318 → (θ+1)²
- A028326 → basis A013609 → (θ+1)²
- A178820 → basis A013609 → (θ+1)²
- A125092 → reverse → D
- A003506 → D → (θ+1)²
- A134346 → (θ+1)²
- A085880 → 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.