A033282 → basis A013609 → basis A008277
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(1 - n\right)\,P_{n-2}(x) + \left(7 + 4\,x + 14\,n + 8\,n x\right)\,P_{n-1}(x) + \left(4\,x + 8\,n x\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 7 + 4\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 7 | 4 | 11 | |||||||||||||
| 2 | 61 | 90 | 20 | 171 | ||||||||||||
| 3 | 595 | 1726 | 924 | 112 | 3357 | |||||||||||
| 4 | 6217 | 32004 | 31136 | 8736 | 672 | 78765 | ||||||||||
| 5 | 68047 | 591304 | 934560 | 456480 | 79200 | 4224 | 2133815 | |||||||||
| 6 | 770149 | 10991862 | 26603916 | 20163000 | 5926800 | 700128 | 27456 | 65183311 | ||||||||
| 7 | 8939707 | 206257594 | 737753940 | 815550120 | 361561200 | 71014944 | 6086080 | 183040 | 2207346625 | |||||||
| 8 | 105843409 | 3910112712 | 20196654368 | 31344881568 | 19678634976 | 5717712000 | 803618816 | 52276224 | 1244672 | 81810978745 | ||||||
| 9 | 1273241431 | 74873417740 | 549755729952 | 1167629416096 | 998080181280 | 402563126784 | 82529900544 | 8712477696 | 445026816 | 8599552 | 3285871117891 | |||||
| 10 | 15517824973 | 1447293396978 | 14940054344644 | 42648459533680 | 48331374232960 | 26003380725504 | 7294586277888 | 1111309355520 | 91359490560 | 3762304000 | 60196864 | 141887157683571 | ||||
| 11 | 191202877411 | 28218779627350 | 406305552624972 | 1538475809366496 | 2267767264963200 | 1583889248361728 | 584040441836544 | 120432218767872 | 14168113344000 | 932761984000 | 31631136768 | 426008576 | 6544453450898917 | |||
| 12 | 2377843390873 | 554526032706828 | 11073008542807744 | 55066959404050880 | 104091579512423360 | 92543995139464704 | 43638573343602688 | 11697857943045120 | 1846866245199360 | 172820648704000 | 9317294424064 | 264733900800 | 3042918400 | 320698149726638821 | ||
| 13 | 29807864423071 | 10974160896307600 | 302638773649198272 | 1961784892479262656 | 4704059285711522880 | 5245830424868743424 | 3100881925223706624 | 1051066432710767616 | 213863253112244736 | 26673008965537792 | 2032526474035200 | 91386751139840 | 2207333007360 | 21909012480 | 16619928107948909551 | |
| 14 | 376255282112629 | 218562887485625742 | 8298557505644776828 | 69708356439195503848 | 210238837535219920336 | 290747064242371857120 | 212227617412963728576 | 89148916273382469504 | 22736189762700640512 | 3629195804538304000 | 366517593705303040 | 23183164648949760 | 882594982563840 | 18346059325440 | 158840340480 | 907344275977021421655 |
Compute more
?
Technical details
- Node id
n-6278112a2d49c618· revision 0 · JSON- Definition source
derived:basis_map_A008277- Fingerprint
f6-3ad12bf5850f5489
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: 7, 4; 2: 61, 90, 20; 3: 595, 1726, 924, 112; 4: 6217, 32004, 31136, 8736, 672; 5: 68047, 591304, 934560, 456480, 79200, 4224; 6: 770149, 10991862, 26603916, 20163000, 5926800, 700128, 27456; 7: 8939707, 206257594, 737753940, 815550120, 361561200, 71014944, 6086080, 183040; 8: 105843409, 3910112712, 20196654368, 31344881568, 19678634976, 5717712000, 803618816, 52276224, 1244672; 9: 1273241431, 74873417740, 549755729952, 1167629416096, 998080181280, 402563126784, 82529900544, 8712477696, 445026816, 8599552;
%F FormulaThe row polynomials satisfy (n+2)*P(n,x) = -(n-1)*P(n-2,x) + (14*n+7+(8*n+4)*x)*P(n-1,x) + (8*n+4)*x*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 7 + 4*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 7 + 4*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n - 1)*P[n - 2, x] + (14*n + 7 + (8*n + 4)*x)*P[n - 1, x] + (8*n + 4)*x*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; v[2] = 7 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n - 1)*v[i - 2] + (14*n + 7 + (8*n + 4)*x)*v[i - 1] + (8*n + 4)*x*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
derived from Ray basis map theorem
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Ray basis map theorem
Proof chains ? JSON
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? 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…?
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
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
- [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