A033282 → x ↦ x+1 → basis A013610
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(1 - n\right)\,P_{n-2}(x) + \left(5 + 6\,x + 10\,n + 12\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 5 + 6\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 5 | 6 | 11 | |||||||||||||
| 2 | 31 | 75 | 45 | 151 | ||||||||||||
| 3 | 215 | 783 | 945 | 378 | 2321 | |||||||||||
| 4 | 1597 | 7770 | 14112 | 11340 | 3402 | 38221 | ||||||||||
| 5 | 12425 | 75660 | 183600 | 221940 | 133650 | 32076 | 659351 | |||||||||
| 6 | 99955 | 731025 | 2220615 | 3586275 | 3247695 | 1563705 | 312741 | 11762011 | ||||||||
| 7 | 824675 | 7040985 | 25692975 | 51943815 | 62837775 | 45486441 | 18243225 | 3127410 | 215197301 | |||||||
| 8 | 6939769 | 67748340 | 288653904 | 701080380 | 1061674614 | 1026485460 | 618810192 | 212663880 | 31899582 | 4015956121 | ||||||
| 9 | 59334605 | 651899826 | 3176353440 | 9008511876 | 16389049950 | 19834830288 | 15969124080 | 8247491928 | 2479467510 | 330595668 | 76146659171 | |||||
| 10 | 513972967 | 6276325575 | 34421550345 | 111650379750 | 237197305800 | 344869925400 | 347531446080 | 239681859300 | 108270081270 | 28927120950 | 3471254514 | 1462811221951 | ||||
| 11 | 4501041935 | 60475900947 | 368680591125 | 1346144807700 | 3270888621000 | 5553455486040 | 6722959597200 | 5803098343020 | 3500181634950 | 1404968012910 | 337779766170 | 36848701764 | 28409982504761 | |||
| 12 | 39784038517 | 583257451950 | 3912701569920 | 15881573961000 | 43440973458300 | 84358689980400 | 119254673332080 | 123656766571800 | 93342606066270 | 50023574894700 | 18066392064864 | 3948075189000 | 394807518900 | 556903876097701 | ||
| 13 | 354455513105 | 5630603962776 | 41218550137440 | 184114426757976 | 559873049006700 | 1223947958784408 | 1978987544099280 | 2396218892458248 | 2172776388263910 | 1457188345157688 | 702581913633600 | 230620232040120 | 46192479711300 | 4263921204120 | 11003968760730671 | |
| 14 | 3179928556219 | 54408155437965 | 431596858690179 | 2103884946395505 | 7040798106681339 | 17112106348822485 | 31148114248097847 | 43136752132142955 | 45673825606696287 | 36794068445759625 | 22199392902341655 | 9727366352537925 | 2926293589710855 | 540985002772725 | 46370143094805 | 218939142767738371 |
Compute more
?
Technical details
- Node id
n-23d52b9eb8e45fdd· revision 0 · JSON- Definition source
derived:basis_map_A013610- Fingerprint
f6-bffe79c3825a54d3
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: 5, 6; 2: 31, 75, 45; 3: 215, 783, 945, 378; 4: 1597, 7770, 14112, 11340, 3402; 5: 12425, 75660, 183600, 221940, 133650, 32076; 6: 99955, 731025, 2220615, 3586275, 3247695, 1563705, 312741; 7: 824675, 7040985, 25692975, 51943815, 62837775, 45486441, 18243225, 3127410; 8: 6939769, 67748340, 288653904, 701080380, 1061674614, 1026485460, 618810192, 212663880, 31899582; 9: 59334605, 651899826, 3176353440, 9008511876, 16389049950, 19834830288, 15969124080, 8247491928, 2479467510, 330595668;
%F FormulaThe row polynomials satisfy (n+2)*P(n,x) = -(n-1)*P(n-2,x) + (10*n+5+(12*n+6)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 5 + 6*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 5 + 6*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n - 1)*P[n - 2, x] + (10*n + 5 + (12*n + 6)*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] = 5 + 6*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n - 1)*v[i - 2] + (10*n + 5 + (12*n + 6)*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
derived from Geometric basis map (elementary)
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Geometric basis map (elementary)
- 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_A007318 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_A007318 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