A033282 → basis A013609 → reverse
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(2 + n\right)\,P_{n}(x) = \left(4 - 2\,x^{2} + 8\,n + 9\,n x + 2\,n x^{2}\right)\,P_{n-1}(x) + \left(-4\,x - 6\,x^{2} - 2\,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 | 4 | 3 | 7 | |||||||||||||
| 2 | 20 | 30 | 11 | 61 | ||||||||||||
| 3 | 112 | 252 | 186 | 45 | 595 | |||||||||||
| 4 | 672 | 2016 | 2240 | 1092 | 197 | 6217 | ||||||||||
| 5 | 4224 | 15840 | 23520 | 17280 | 6280 | 903 | 68047 | |||||||||
| 6 | 27456 | 123552 | 229680 | 225720 | 123660 | 35802 | 4279 | 770149 | ||||||||
| 7 | 183040 | 960960 | 2146144 | 2642640 | 1937320 | 845460 | 203350 | 20793 | 8939707 | |||||||
| 8 | 1244672 | 7468032 | 19475456 | 28828800 | 26490464 | 15471456 | 5608064 | 1153416 | 103049 | 105843409 | ||||||
| 9 | 8599552 | 58046976 | 173122560 | 299400192 | 330849792 | 242240544 | 117507936 | 36414144 | 6540876 | 518859 | 1273241431 | |||||
| 10 | 60196864 | 451476480 | 1515671040 | 2999093760 | 3873192960 | 3411023616 | 2074450560 | 860212080 | 232754340 | 37106550 | 2646723 | 15517824973 | ||||
| 11 | 426008576 | 3514570752 | 13115970560 | 29224419840 | 43195384320 | 44466960384 | 32530891008 | 16911861120 | 6122534880 | 1469977740 | 210649362 | 13648869 | 191202877411 | |||
| 12 | 3042918400 | 27386265600 | 112466264064 | 278655252480 | 463906967040 | 546668559360 | 467536143360 | 292391548416 | 132701722560 | 42623254080 | 9196640640 | 1196815500 | 71039373 | 2377843390873 | ||
| 13 | 21909012480 | 213612871680 | 957302128640 | 2610823987200 | 4834375749632 | 6417731713536 | 6283714145280 | 4594340754432 | 2508342051072 | 1009947242304 | 291483356736 | 57102948864 | 6805767696 | 372693519 | 29807864423071 | |
| 14 | 158840340480 | 1667823575040 | 8099488051200 | 24111552890880 | 49154200775680 | 72589065669120 | 80076419334912 | 67032497930112 | 42787334606016 | 20723659276320 | 7497022316784 | 1964305737576 | 352366829724 | 38735977266 | 1968801519 | 376255282112629 |
Compute more
?
Technical details
- Node id
n-1dd418d798e58c37· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-9a4b425d2a954ae8
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: 4, 3; 2: 20, 30, 11; 3: 112, 252, 186, 45; 4: 672, 2016, 2240, 1092, 197; 5: 4224, 15840, 23520, 17280, 6280, 903; 6: 27456, 123552, 229680, 225720, 123660, 35802, 4279; 7: 183040, 960960, 2146144, 2642640, 1937320, 845460, 203350, 20793; 8: 1244672, 7468032, 19475456, 28828800, 26490464, 15471456, 5608064, 1153416, 103049; 9: 8599552, 58046976, 173122560, 299400192, 330849792, 242240544, 117507936, 36414144, 6540876, 518859;
%F FormulaThe row polynomials satisfy (n+2)*P(n,x) = (8*n+4+9*n*x+(2*n-2)*x^2)*P(n-1,x) - (4*x+6*x^2+2*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[((8*n + 4 + 9*n*x + (2*n - 2)*x^2)*P[n - 1, x] - (4*x + 6*x^2 + 2*x^3)*D[P[n - 1, x], x])/(n + 2)]];
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] = ((8*n + 4 + 9*n*x + (2*n - 2)*x^2)*v[i - 1] - (4*x + 6*x^2 + 2*x^3)*deriv(v[i - 1], x))/(n + 2)); 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_A013609 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_A013609 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 ?
- A063007 → basis A013609 → D
- A114656 → basis A007318 → x ↦ x/(x+1)
- A114655 → x ↦ x+1 → x ↦ x/(x+1)
- A033282 → basis A013609
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