A033282 → basis A013610 → D
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-6 + 3\,n + 3\,n^{2}\right)\,P_{n}(x) = \left(27\,n + 54\,n x + 9\,n^{2} + 18\,n^{2} x\right)\,P_{n-1}(x) + \left(4\,n + 18\,n x + 18\,n x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 6\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 0 | ||||||||||||||
| 1 | 6 | 6 | |||||||||||||
| 2 | 45 | 90 | 135 | ||||||||||||
| 3 | 279 | 1134 | 1134 | 2547 | |||||||||||
| 4 | 1638 | 10080 | 20412 | 13608 | 45738 | ||||||||||
| 5 | 9420 | 77760 | 238140 | 320760 | 160380 | 806460 | |||||||||
| 6 | 53703 | 556470 | 2285415 | 4651020 | 4691115 | 1876446 | 14114169 | ||||||||
| 7 | 305025 | 3804570 | 19615365 | 53513460 | 81486405 | 65675610 | 21891870 | 246292305 | |||||||
| 8 | 1730124 | 25236288 | 156648492 | 536431896 | 1094593500 | 1331025696 | 893188296 | 255196656 | 4294050948 | ||||||
| 9 | 9811314 | 163863648 | 1189767852 | 4905371016 | 12561953040 | 20462131872 | 20705728680 | 11901444048 | 2975361012 | 74875432482 | |||||
| 10 | 55659825 | 1047394530 | 8709647310 | 42007623840 | 129512302920 | 264708531360 | 358696299780 | 310759927920 | 156206453130 | 34712545140 | 1306416385755 | ||||
| 11 | 315974043 | 6614899830 | 61990665660 | 342465187680 | 1235157267960 | 3039038823744 | 5166235457460 | 5991919330320 | 4537997728110 | 2026678597020 | 405335719404 | 22813749651231 | |||
| 12 | 1795223250 | 41384882880 | 431560447560 | 2687209881840 | 11101741603920 | 31953173297760 | 65382413869080 | 95115425335920 | 96411996115380 | 64853715104640 | 26057296247400 | 4737690226800 | 398775402236430 | ||
| 13 | 10208651544 | 256963269888 | 2951268986952 | 20451431656656 | 95238612251640 | 313994475935712 | 751542030078840 | 1315835555390928 | 1672646798671992 | 1505532672072000 | 910847266603560 | 332585853921360 | 55430975653560 | 6977324113144632 | |
| 14 | 58103965899 | 1585650733758 | 19888595592957 | 151814701914876 | 786851438147775 | 2924246899479906 | 8017191490719411 | 16418168351761176 | 25115107843921095 | 28344789078155550 | 22941495048617145 | 12610546961184900 | 4219683021627255 | 649182003327270 | 122200609189148973 |
Compute more
?
Technical details
- Node id
n-e6acc766da1264ad· revision 0 · JSON- Definition source
derived:derivative- Fingerprint
f6-c9c0a2736821f4fb
Observed on the stored rows ?
- Degrees: -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (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 = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 0; 1: 6; 2: 45, 90; 3: 279, 1134, 1134; 4: 1638, 10080, 20412, 13608; 5: 9420, 77760, 238140, 320760, 160380; 6: 53703, 556470, 2285415, 4651020, 4691115, 1876446; 7: 305025, 3804570, 19615365, 53513460, 81486405, 65675610, 21891870; 8: 1730124, 25236288, 156648492, 536431896, 1094593500, 1331025696, 893188296, 255196656; 9: 9811314, 163863648, 1189767852, 4905371016, 12561953040, 20462131872, 20705728680, 11901444048, 2975361012;
%F FormulaThe row polynomials satisfy (3*n^2+3*n-6)*P(n,x) = (9*n^2+27*n+(18*n^2+54*n)*x)*P(n-1,x) + (4*n+18*n*x+18*n*x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 6.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 6;
P[n_, x_] := P[n, x] = Expand[Together[((9*n^2 + 27*n + (18*n^2 + 54*n)*x)*P[n - 1, x] + (4*n + 18*n*x + 18*n*x^2)*D[P[n - 1, x], x])/(3*n^2 + 3*n - 6)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 6; for(n = 2, N, my(i = n + 1); v[i] = ((9*n^2 + 27*n + (18*n^2 + 54*n)*x)*v[i - 1] + (4*n + 18*n*x + 18*n*x^2)*deriv(v[i - 1], x))/(3*n^2 + 3*n - 6)); 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) is the number of diagonal dissections of a convex n-gon into k+1 re…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
-
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 of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan tri…?
-
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)
-
from
Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan tri…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
-
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
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
- ↑ Three-term recurrence criterion (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Three-term recurrence criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Three-term recurrence criterion (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
- ↑ Three-term recurrence criterion (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Three-term recurrence criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks …?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
- ↑ Three-term recurrence criterion (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
- ↑ Three-term recurrence criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions.?
-
-
from
basis_map_A013610 of Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 re…?
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