A114687 → basis A013609 → x ↦ x/(x+1)
nonnegative coefficients
Proved for all n all roots real, in [−1, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(2 + 4\,x + 2\,x^{2} + n + 2\,n x + n x^{2}\right)\,P_{n}(x) = \left(1 - 4\,x - 26\,x^{2} - 36\,x^{3} - 15\,x^{4} + 8\,n + 43\,n x + 77\,n x^{2} + 57\,n x^{3} + 15\,n x^{4}\right)\,P_{n-1}(x) + \left(-1 - 11\,x - 42\,x^{2} - 70\,x^{3} - 53\,x^{4} - 15\,x^{5}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 3 | 7 | 10 | ||||||
| 2 | 11 | 50 | 55 | 116 | |||||
| 3 | 45 | 303 | 663 | 469 | 1480 | ||||
| 4 | 197 | 1756 | 5750 | 8172 | 4237 | 20112 | |||
| 5 | 903 | 10015 | 43670 | 93390 | 97715 | 39907 | 285600 | ||
| 6 | 4279 | 56766 | 309165 | 883540 | 1395105 | 1151886 | 387739 | 4188480 | |
| 7 | 20793 | 321055 | 2097165 | 7504315 | 15867915 | 19801117 | 13482735 | 3858505 | 62953600 |
Compute more
?
Technical details
- Node id
n-de5608bc74fa9bc0· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-37e408febc5a0069
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, 7; 2: 11, 50, 55; 3: 45, 303, 663, 469; 4: 197, 1756, 5750, 8172, 4237; 5: 903, 10015, 43670, 93390, 97715, 39907; 6: 4279, 56766, 309165, 883540, 1395105, 1151886, 387739; 7: 20793, 321055, 2097165, 7504315, 15867915, 19801117, 13482735, 3858505; 8: 103049, 1815128, 13827436, 59452232, 157655974, 263779880, 271646284, 157250744, 39130777; 9: 518859, 10266903, 89359596, 448709772, 1431528714, 3006817506, 4154638908, 3638412540, 1830870531, 402972031;
%F FormulaThe row polynomials satisfy (n+2+(2*n+4)*x+(n+2)*x^2)*P(n,x) = (8*n+1+(43*n-4)*x+(77*n-26)*x^2+(57*n-36)*x^3+(15*n-15)*x^4)*P(n-1,x) - (1+11*x+42*x^2+70*x^3+53*x^4+15*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[((8*n + 1 + (43*n - 4)*x + (77*n - 26)*x^2 + (57*n - 36)*x^3 + (15*n - 15)*x^4)*P[n - 1, x] - (1 + 11*x + 42*x^2 + 70*x^3 + 53*x^4 + 15*x^5)*D[P[n - 1, x], x])/(n + 2 + (2*n + 4)*x + (n + 2)*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] = ((8*n + 1 + (43*n - 4)*x + (77*n - 26)*x^2 + (57*n - 36)*x^3 + (15*n - 15)*x^4)*v[i - 1] - (1 + 11*x + 42*x^2 + 70*x^3 + 53*x^4 + 15*x^5)*deriv(v[i - 1], x))/(n + 2 + (2*n + 4)*x + (n + 2)*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_A013609 of Triangle read by rows: T(n,k) is the number of double rise-bicolored Dyck paths (double rises come…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of double rise-bicolored Dyck paths (double rises come in two colors; also …?
-
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 read by rows: T(n,k) is the number of double rise-bicolored Dyck paths (double rises come in two colors; also …?
-
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 …?
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A013609 of Triangle read by rows: T(n,k) is the number of double rise-bicolored Dyck paths (double rises come…?
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