A104684 → basis A013611 → basis A013610
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(1 - n\right)\,P_{n}(x) = \left(-50 - 240\,x - 288\,x^{2} + 25\,n + 120\,n x + 144\,n x^{2}\right)\,P_{n-2}(x) + \left(21 + 36\,x - 14\,n - 24\,n x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 7 + 12\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | |||||||
| 2 | 7 | 12 | 19 | ||||||
| 3 | 61 | 192 | 144 | 397 | |||||
| 4 | 595 | 2700 | 3888 | 1728 | 8911 | ||||
| 5 | 6145 | 36480 | 77760 | 69120 | 20736 | 210241 | |||
| 6 | 65527 | 481260 | 1362240 | 1831680 | 1140480 | 248832 | 5130019 | ||
| 7 | 712909 | 6243264 | 22064400 | 39882240 | 38257920 | 17915904 | 2985984 | 128062621 | |
| 8 | 7863667 | 79997484 | 339193008 | 771422400 | 1005177600 | 736791552 | 271724544 | 35831808 | 3248002063 |
Compute more
?
Technical details
- Node id
n-36ff311318433b63· revision 0 · JSON- Definition source
derived:basis_map_A013610- Fingerprint
f6-2999dcf3b57aaeda
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 -1)
- 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 = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 1; 2: 7, 12; 3: 61, 192, 144; 4: 595, 2700, 3888, 1728; 5: 6145, 36480, 77760, 69120, 20736; 6: 65527, 481260, 1362240, 1831680, 1140480, 248832; 7: 712909, 6243264, 22064400, 39882240, 38257920, 17915904, 2985984; 8: 7863667, 79997484, 339193008, 771422400, 1005177600, 736791552, 271724544, 35831808; 9: 87615745, 1015472640, 5023823616, 13780924416, 22745318400, 22852730880, 13377208320, 4013162496, 429981696; 10: 983726695, 12796248780, 72366255360, 232524794880, 465072233472, 595390279680, 481579499520, 232190115840, 58047528960, 5159780352;
%F FormulaThe row polynomials satisfy -(n-1)*P(n,x) = (25*n-50+(120*n-240)*x+(144*n-288)*x^2)*P(n-2,x) - (14*n-21+(24*n-36)*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 7 + 12*x.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 7 + 12*x;
P[n_, x_] := P[n, x] = Expand[Together[((25*n - 50 + (120*n - 240)*x + (144*n - 288)*x^2)*P[n - 2, x] - (14*n - 21 + (24*n - 36)*x)*P[n - 1, x])/(-n + 1)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 7 + 12*x; for(n = 3, N, my(i = n); v[i] = ((25*n - 50 + (120*n - 240)*x + (144*n - 288)*x^2)*v[i - 2] - (14*n - 21 + (24*n - 36)*x)*v[i - 1])/(-n + 1)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
derived from Geometric basis map (elementary)
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
derived from Geometric basis map (elementary)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 2
Proof chains ? JSON
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis_map_A013611 of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
-
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
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle 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 read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Three-term recurrence criterion (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
- ↑ Three-term recurrence criterion (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Three-term recurrence criterion (above)
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle read by rows: T(n,k) = C(n+k,n)*C(n,k)/(k+1), for n >= 0, k = 0..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
-
from
Triangle read by rows: T(n,k) = C(n+k,n)*C(n,k)/(k+1), for n >= 0, k = 0..n.?
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
-
from
T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,0), N=(0,1) and D=(1,…?
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A013611 of Triangle read by rows: T(n,k) is the number of lattice paths from (0,0) to (n,n) using steps E=(1,…?
Related ?
Same fingerprint ?
References
- [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
- [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
- [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.
- [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023