A178821 → basis A013610 → D+1
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-n + 3\,n x + 3\,n^{2}\right)\,P_{n}(x) = \left(16 + 48\,x + 36\,x^{2} + 28\,n + 48\,n x + 9\,n x^{2} + 6\,n^{2} + 9\,n^{2} x\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 | 25 | 15 | 40 | ||||||
| 2 | 240 | 450 | 135 | 825 | |||||
| 3 | 1540 | 5040 | 4725 | 945 | 12250 | ||||
| 4 | 7840 | 36960 | 60480 | 37800 | 5670 | 148750 | |||
| 5 | 34272 | 211680 | 498960 | 544320 | 255150 | 30618 | 1575000 | ||
| 6 | 134400 | 1028160 | 3175200 | 4989600 | 4082400 | 1530900 | 153090 | 15093750 | |
| 7 | 485760 | 4435200 | 16964640 | 34927200 | 41164200 | 26943840 | 8419950 | 721710 | 134062500 |
Compute more
?
Technical details
- Node id
n-7ecf7fa89e3ab64f· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-bff12ef9596281bf
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: 25, 15; 2: 240, 450, 135; 3: 1540, 5040, 4725, 945; 4: 7840, 36960, 60480, 37800, 5670; 5: 34272, 211680, 498960, 544320, 255150, 30618; 6: 134400, 1028160, 3175200, 4989600, 4082400, 1530900, 153090; 7: 485760, 4435200, 16964640, 34927200, 41164200, 26943840, 8419950, 721710; 8: 1647360, 17487360, 79833600, 203575680, 314344800, 296382240, 161663040, 43302600, 3247695; 9: 5308160, 64247040, 341003520, 1037836800, 1984862880, 2451889440, 1926484560, 900694080, 211100175, 14073345;
%F FormulaThe row polynomials satisfy (3*n^2-n+3*n*x)*P(n,x) = (6*n^2+28*n+16+(9*n^2+48*n+48)*x+(9*n+36)*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[((6*n^2 + 28*n + 16 + (9*n^2 + 48*n + 48)*x + (9*n + 36)*x^2)*P[n - 1, x])/(3*n^2 - n + 3*n*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] = ((6*n^2 + 28*n + 16 + (9*n^2 + 48*n + 48)*x + (9*n + 36)*x^2)*v[i - 1])/(3*n^2 - n + 3*n*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 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_A013610 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 ›
-
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 ›
-
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.?
-
-
from
basis_map_A013610 of Triangle read by rows: T(n,k) = binomial(n+4,4) * binomial(n,k), 0 <= k <= n.?
Related ?
Same fingerprint ?
- A038221 → basis A013610 → D+1
- A028326 → basis A013610 → D+1
- A178820 → basis A013610 → D+1
- A196347 → basis A013610 → D+1
- A013620 → D+1
- A038208 → basis A013610 → D+1
- A156992 → basis A013610 → D+1
- A178822 → basis A013610 → D+1
- A038338 → basis A013610 → D+1
- A085880 → basis A013610 → 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.