A033282 → basis A013610 → reverse
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(6 + 3\,n\right)\,P_{n}(x) = \left(18 - 4\,x^{2} + 36\,n + 27\,n x + 4\,n x^{2}\right)\,P_{n-1}(x) + \left(-18\,x - 18\,x^{2} - 4\,x^{3}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 6 | 3 | 9 | |||||||||||||
| 2 | 45 | 45 | 11 | 101 | ||||||||||||
| 3 | 378 | 567 | 279 | 45 | 1269 | |||||||||||
| 4 | 3402 | 6804 | 5040 | 1638 | 197 | 17081 | ||||||||||
| 5 | 32076 | 80190 | 79380 | 38880 | 9420 | 903 | 240849 | |||||||||
| 6 | 312741 | 938223 | 1162755 | 761805 | 278235 | 53703 | 4279 | 3511741 | ||||||||
| 7 | 3127410 | 10945935 | 16297281 | 13378365 | 6538455 | 1902285 | 305025 | 20793 | 52515549 | |||||||
| 8 | 31899582 | 127598328 | 221837616 | 218918700 | 134107974 | 52216164 | 12618144 | 1730124 | 103049 | 801029681 | ||||||
| 9 | 330595668 | 1487680506 | 2957961240 | 3410355312 | 2512390608 | 1226342754 | 396589284 | 81931824 | 9811314 | 518859 | 12414177369 | |||||
| 10 | 3471254514 | 17356272570 | 38844990990 | 51242328540 | 44118088560 | 25902460584 | 10501905960 | 2903215770 | 523697265 | 55659825 | 2646723 | 194922521301 | ||||
| 11 | 36848701764 | 202667859702 | 504221969790 | 748989916290 | 738033636780 | 506506470624 | 247031453592 | 85616296920 | 20663555220 | 3307449915 | 315974043 | 13648869 | 3094216933509 | |||
| 12 | 394807518900 | 2368845113400 | 6485371510464 | 10712444012820 | 11889428166990 | 9340344838440 | 5325528882960 | 2220348320784 | 671802470460 | 143853482520 | 20692441440 | 1795223250 | 71039373 | 49575333021801 | ||
| 13 | 4263921204120 | 27715487826780 | 82804296963960 | 150553267207200 | 185849644296888 | 164479444423866 | 107363147154120 | 52332412655952 | 19047722450328 | 5112857914164 | 983756328984 | 128481634944 | 10208651544 | 372693519 | 800645021406369 | |
| 14 | 46370143094805 | 324591001663635 | 1050878913432075 | 2085590458965195 | 2834478907815555 | 2790567538213455 | 2052271043970147 | 1145313070102773 | 487374483246651 | 157370287629555 | 37953675478719 | 6629531864319 | 792825366879 | 58103965899 | 1968801519 | 13020241953611181 |
Compute more
?
Technical details
- Node id
n-a84321342ff00533· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-6a81dd80276de4b8
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: 6, 3; 2: 45, 45, 11; 3: 378, 567, 279, 45; 4: 3402, 6804, 5040, 1638, 197; 5: 32076, 80190, 79380, 38880, 9420, 903; 6: 312741, 938223, 1162755, 761805, 278235, 53703, 4279; 7: 3127410, 10945935, 16297281, 13378365, 6538455, 1902285, 305025, 20793; 8: 31899582, 127598328, 221837616, 218918700, 134107974, 52216164, 12618144, 1730124, 103049; 9: 330595668, 1487680506, 2957961240, 3410355312, 2512390608, 1226342754, 396589284, 81931824, 9811314, 518859;
%F FormulaThe row polynomials satisfy (3*n+6)*P(n,x) = (36*n+18+27*n*x+(4*n-4)*x^2)*P(n-1,x) - (18*x+18*x^2+4*x^3)*d/dx 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[((36*n + 18 + 27*n*x + (4*n - 4)*x^2)*P[n - 1, x] - (18*x + 18*x^2 + 4*x^3)*D[P[n - 1, x], x])/(3*n + 6)]];
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] = ((36*n + 18 + 27*n*x + (4*n - 4)*x^2)*v[i - 1] - (18*x + 18*x^2 + 4*x^3)*deriv(v[i - 1], x))/(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
- Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) 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…?
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