A126216 → basis A013610 → x ↦ x/(x+1)
nonnegative coefficients
Proved for all n all roots real, in [−1, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(6 + 12\,x + 6\,x^{2} + 3\,n + 6\,n x + 3\,n x^{2}\right)\,P_{n}(x) = \left(2 - 16\,x - 78\,x^{2} - 100\,x^{3} - 40\,x^{4} + 25\,n + 124\,n x + 213\,n x^{2} + 154\,n x^{3} + 40\,n x^{4}\right)\,P_{n-1}(x) + \left(-4 - 38\,x - 130\,x^{2} - 202\,x^{3} - 146\,x^{4} - 40\,x^{5}\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 | 3 | 6 | 9 | |||||||||||||
| 2 | 11 | 43 | 41 | 95 | ||||||||||||
| 3 | 45 | 261 | 495 | 306 | 1107 | |||||||||||
| 4 | 197 | 1514 | 4296 | 5324 | 2426 | 13757 | ||||||||||
| 5 | 903 | 8640 | 32640 | 60780 | 55710 | 20076 | 178749 | |||||||||
| 6 | 4279 | 48993 | 231135 | 574595 | 793095 | 575673 | 171481 | 2399251 | ||||||||
| 7 | 20793 | 277179 | 1568133 | 4877565 | 9001965 | 9850491 | 5912823 | 1500666 | 33009615 | |||||||
| 8 | 103049 | 1567444 | 10340624 | 38625244 | 89299574 | 130777780 | 118403936 | 60556360 | 13386206 | 463060217 | ||||||
| 9 | 518859 | 8867610 | 66832560 | 291419100 | 809859330 | 1486838808 | 1802518704 | 1390770216 | 619414074 | 121267476 | 6598306737 | |||||
| 10 | 2646723 | 50209095 | 425584125 | 2121870150 | 6888848400 | 15212043000 | 23129966160 | 23902815780 | 16060786110 | 6333508470 | 1112674026 | 95240952039 | ||||
| 11 | 13648869 | 284576193 | 2679492915 | 15035387400 | 55849483800 | 144154450440 | 263744601120 | 341940477780 | 307763389890 | 183085502490 | 64768540518 | 10318939956 | 1389638491371 | |||
| 12 | 71039373 | 1614666654 | 16720196328 | 104282086920 | 436186763100 | 1288714719600 | 2757034708560 | 4302252745560 | 4858738244910 | 3871857701580 | 2066012814096 | 662613483528 | 96572168916 | 20462671339125 | ||
| 13 | 372693519 | 9171411444 | 103587872544 | 710881749864 | 3306451483764 | 11004663311928 | 26957648841552 | 49201444883448 | 66890955510522 | 66889412420688 | 47809598934240 | 23124782960136 | 6782636799900 | 910896992856 | 303702505866405 | |
| 14 | 1968801519 | 52148919165 | 637994151795 | 4777536490545 | 24460071110475 | 90557554844757 | 249970764794751 | 522527690389419 | 831031464814551 | 1000493352547689 | 897377746624359 | 581368788888069 | 257118983177511 | 69472483213749 | 8650566601401 | 4538499115369755 |
Compute more
?
Technical details
- Node id
n-503a4b66c4a2e621· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-08e302df1914bf50
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: 3, 6; 2: 11, 43, 41; 3: 45, 261, 495, 306; 4: 197, 1514, 4296, 5324, 2426; 5: 903, 8640, 32640, 60780, 55710, 20076; 6: 4279, 48993, 231135, 574595, 793095, 575673, 171481; 7: 20793, 277179, 1568133, 4877565, 9001965, 9850491, 5912823, 1500666; 8: 103049, 1567444, 10340624, 38625244, 89299574, 130777780, 118403936, 60556360, 13386206; 9: 518859, 8867610, 66832560, 291419100, 809859330, 1486838808, 1802518704, 1390770216, 619414074, 121267476;
%F FormulaThe row polynomials satisfy (3*n+6+(6*n+12)*x+(3*n+6)*x^2)*P(n,x) = (25*n+2+(124*n-16)*x+(213*n-78)*x^2+(154*n-100)*x^3+(40*n-40)*x^4)*P(n-1,x) - (4+38*x+130*x^2+202*x^3+146*x^4+40*x^5)*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[((25*n + 2 + (124*n - 16)*x + (213*n - 78)*x^2 + (154*n - 100)*x^3 + (40*n - 40)*x^4)*P[n - 1, x] - (4 + 38*x + 130*x^2 + 202*x^3 + 146*x^4 + 40*x^5)*D[P[n - 1, x], x])/(3*n + 6 + (6*n + 12)*x + (3*n + 6)*x^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] = ((25*n + 2 + (124*n - 16)*x + (213*n - 78)*x^2 + (154*n - 100)*x^3 + (40*n - 40)*x^4)*v[i - 1] - (4 + 38*x + 130*x^2 + 202*x^3 + 146*x^4 + 40*x^5)*deriv(v[i - 1], x))/(3*n + 6 + (6*n + 12)*x + (3*n + 6)*x^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 [-1, 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 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 …?
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