A126216 → basis A013610 → basis A013611
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(2 + n\right)\,P_{n}(x) = \left(16 + 96\,x + 144\,x^{2} - 16\,n - 96\,n x - 144\,n x^{2}\right)\,P_{n-2}(x) + \left(6 + 12\,x + 12\,n + 24\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 6 + 12\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 6 | 12 | 18 | |||||||||||||
| 2 | 41 | 156 | 144 | 341 | ||||||||||||
| 3 | 306 | 1692 | 3024 | 1728 | 6750 | |||||||||||
| 4 | 2426 | 17520 | 46080 | 51840 | 20736 | 138602 | ||||||||||
| 5 | 20076 | 178680 | 619200 | 1036800 | 829440 | 248832 | 2933028 | |||||||||
| 6 | 171481 | 1812852 | 7791120 | 17323200 | 20839680 | 12690432 | 2985984 | 63614749 | ||||||||
| 7 | 1500666 | 18367356 | 94200624 | 261213120 | 420215040 | 388426752 | 188116992 | 35831808 | 1407872358 | |||||||
| 8 | 13386206 | 186133152 | 1109170944 | 3685747968 | 7432072704 | 9245601792 | 6855819264 | 2723217408 | 429981696 | 31681131134 | ||||||
| 9 | 121267476 | 1887972840 | 12817388160 | 49647790080 | 120426227712 | 188649990144 | 189371105280 | 116095057920 | 38698352640 | 5159780352 | 722874932604 | |||||
| 10 | 1112674026 | 19172927160 | 146072656800 | 646275283200 | 1832729794560 | 3465658441728 | 4399429386240 | 3670968729600 | 1902669004800 | 541776936960 | 61917364224 | 16687783199298 | ||||
| 11 | 10318939956 | 194959195992 | 1647068718240 | 8195001724800 | 26607813534720 | 58985253347328 | 90678911533056 | 96062210703360 | 68109100646400 | 30365307371520 | 7492001071104 | 743008370688 | 389090955157164 | |||
| 12 | 96572168916 | 1985010173856 | 18416442299904 | 101785984439040 | 372376165455360 | 947222390366208 | 1711452418080768 | 2202251011817472 | 1989637102632960 | 1219152901570560 | 474039340498944 | 102535155154944 | 8916100448256 | 9149866595107188 | ||
| 13 | 910896992856 | 20236096428912 | 204529708865664 | 1243233586603008 | 5060541388750848 | 14530771468781568 | 30187712103284736 | 45762845269819392 | 50361117684793344 | 39457191216807936 | 21179205937004544 | 7263649831845888 | 1390911669927936 | 106993205379072 | 216769850065285704 | |
| 14 | 8650566601401 | 206541796823460 | 2258852194020240 | 14976739934694720 | 67138797425027328 | 214820722768684032 | 504635409327329280 | 881306109118955520 | 1145138245269258240 | 1095747214018609152 | 754473794773450752 | 358691005991485440 | 109534294006824960 | 18723810941337600 | 1283918464548864 | 5168944106597650989 |
Compute more
?
Technical details
- Node id
n-532659526f72ee26· revision 0 · JSON- Definition source
derived:basis_map_A013610- Fingerprint
f6-a37a1ca9ecf191e0
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, 12; 2: 41, 156, 144; 3: 306, 1692, 3024, 1728; 4: 2426, 17520, 46080, 51840, 20736; 5: 20076, 178680, 619200, 1036800, 829440, 248832; 6: 171481, 1812852, 7791120, 17323200, 20839680, 12690432, 2985984; 7: 1500666, 18367356, 94200624, 261213120, 420215040, 388426752, 188116992, 35831808; 8: 13386206, 186133152, 1109170944, 3685747968, 7432072704, 9245601792, 6855819264, 2723217408, 429981696; 9: 121267476, 1887972840, 12817388160, 49647790080, 120426227712, 188649990144, 189371105280, 116095057920, 38698352640, 5159780352;
%F FormulaThe row polynomials satisfy (n+2)*P(n,x) = -(16*n-16+(96*n-96)*x+(144*n-144)*x^2)*P(n-2,x) + (12*n+6+(24*n+12)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 6 + 12*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 6 + 12*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(16*n - 16 + (96*n - 96)*x + (144*n - 144)*x^2)*P[n - 2, x] + (12*n + 6 + (24*n + 12)*x)*P[n - 1, 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; v[2] = 6 + 12*x; for(n = 2, N, my(i = n + 1); v[i] = (-(16*n - 16 + (96*n - 96)*x + (144*n - 144)*x^2)*v[i - 2] + (12*n + 6 + (24*n + 12)*x)*v[i - 1])/(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)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis_map_A013610 of Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly …?
-
Geometric basis map (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 ›
-
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…?
-
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.?
-
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) 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 …?
- ↑ 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)
-
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 ›
-
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)
-
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.?
- ↑ 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 …?
-
Geometric basis map (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) (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 Schroeder paths of semilength n containing exactly k peaks but no peaks …?
-
-
from
basis_map_A013610 of Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly …?
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis_map_A013611 of 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 c…?
-
Geometric basis map (elementary) polytool ? step ›
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A013611 of 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 c…?
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