A178821 → basis A007318 → θ+1
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(2\,n + n^{2} x\right)\,P_{n}(x) = \left(16 + 16\,x + 4\,x^{2} + 4\,n + 12\,n x + 5\,n x^{2} + 2\,n^{2} x + n^{2} x^{2}\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 | 10 | 10 | 20 | ||||||
| 2 | 60 | 120 | 45 | 225 | |||||
| 3 | 280 | 840 | 630 | 140 | 1890 | ||||
| 4 | 1120 | 4480 | 5040 | 2240 | 350 | 13230 | |||
| 5 | 4032 | 20160 | 30240 | 20160 | 6300 | 756 | 81648 | ||
| 6 | 13440 | 80640 | 151200 | 134400 | 63000 | 15120 | 1470 | 459270 | |
| 7 | 42240 | 295680 | 665280 | 739200 | 462000 | 166320 | 32340 | 2640 | 2405700 |
Compute more
?
Technical details
- Node id
n-3b2bfb7c3621f647· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-e620d4a356abb37c
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 ℚ): yes
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 10, 10; 2: 60, 120, 45; 3: 280, 840, 630, 140; 4: 1120, 4480, 5040, 2240, 350; 5: 4032, 20160, 30240, 20160, 6300, 756; 6: 13440, 80640, 151200, 134400, 63000, 15120, 1470; 7: 42240, 295680, 665280, 739200, 462000, 166320, 32340, 2640; 8: 126720, 1013760, 2661120, 3548160, 2772000, 1330560, 388080, 63360, 4455; 9: 366080, 3294720, 9884160, 15375360, 14414400, 8648640, 3363360, 823680, 115830, 7150;
%F FormulaThe row polynomials satisfy (2*n+n^2*x)*P(n,x) = (4*n+16+(2*n^2+12*n+16)*x+(n^2+5*n+4)*x^2)*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[((4*n + 16 + (2*n^2 + 12*n + 16)*x + (n^2 + 5*n + 4)*x^2)*P[n - 1, x])/(2*n + n^2*x)]];
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] = ((4*n + 16 + (2*n^2 + 12*n + 16)*x + (n^2 + 5*n + 4)*x^2)*v[i - 1])/(2*n + n^2*x)); 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 read by rows: T(n,k) = binomial(n+4,4) * binomial(n,k), 0 <= k <= n.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = binomial(n+4,4) * binomial(n,k), 0 <= k <= n.?
-
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 ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
-
from
Triangle read by rows: T(n,k) = binomial(n+4,4) * binomial(n,k), 0 <= k <= n.?
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
basis_map_A007318 of Triangle read by rows: T(n,k) = binomial(n+4,4) * binomial(n,k), 0 <= k <= n.?
Related ?
Same fingerprint ?
- A132440 → D+1 → basis A013609
- A038221 → x ↦ x+1 → θ+1
- A038325 → basis A007318 → θ+1
- A038208 → basis A007318 → θ+1
- A094305 → x ↦ x+1 → θ+1
- A003506 → x ↦ x+1 → θ+1
- A038207 → θ+1
- A135065 → x ↦ x+1 → θ+1
- A120910 → θ+1
- basis-map coefficients of A113214, shifted → x ↦ x+1 → θ+1
- A178822 → x ↦ x+1 → θ+1
- A131431 → D+1 → basis A013609
- A038330 → basis A013609 → θ+1
- A178820 → basis A007318 → θ+1
- A156992 → basis A007318 → θ+1
- A028326 → basis A007318 → θ+1
- A027466 → basis A013611 → θ+1
- A038338 → x ↦ x+1 → θ+1
- A085880 → x ↦ x+1 → θ+1
- A120910 → D → θ+1
- A196347 → x ↦ x+1 → θ+1
- image under θ+1 → θ+1 → D+1 → basis A013609
- A085881 → basis A007318 → θ+1
- A356546 → 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.