A126216 → basis A007318 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(2\,x + 2\,x^{2} + 6\,n + 5\,n x + n x^{2} + 5\,n^{2} + 2\,n^{2} x + n^{3}\right)\,P_{n}(x) = \left(2\,x + 2\,x^{2} + 12\,n + 18\,n x + 13\,n x^{2} + 3\,n x^{3} + 29\,n^{2} + 25\,n^{2} x + 6\,n^{2} x^{2} + 7\,n^{3} + 3\,n^{3} x\right)\,P_{n-1}(x) + \left(-12 - 30\,x - 28\,x^{2} - 12\,x^{3} - 2\,x^{4} - 18\,n - 35\,n x - 21\,n x^{2} - 4\,n x^{3} - 4\,n^{2} - 6\,n^{2} x - 2\,n^{2} x^{2}\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 | 4 | 1 | 5 | |||||||||||||
| 2 | 18 | 9 | 1 | 28 | ||||||||||||
| 3 | 87 | 66 | 15 | 1 | 169 | |||||||||||
| 4 | 439 | 450 | 158 | 22 | 1 | 1070 | ||||||||||
| 5 | 2278 | 2955 | 1420 | 310 | 30 | 1 | 6994 | |||||||||
| 6 | 12052 | 18963 | 11640 | 3515 | 540 | 39 | 1 | 46750 | ||||||||
| 7 | 64669 | 119812 | 89838 | 34930 | 7490 | 868 | 49 | 1 | 317657 | |||||||
| 8 | 350733 | 748548 | 664552 | 317576 | 88284 | 14392 | 1316 | 60 | 1 | 2185462 | ||||||
| 9 | 1918152 | 4637205 | 4763412 | 2708328 | 930384 | 197820 | 25620 | 1908 | 72 | 1 | 15182902 | |||||
| 10 | 10560678 | 28537245 | 33324735 | 22009830 | 9035040 | 2385348 | 405090 | 42990 | 2670 | 85 | 1 | 106303712 | ||||
| 11 | 58461747 | 174683718 | 228692805 | 172270395 | 82440270 | 26110392 | 5529678 | 773190 | 68805 | 3630 | 99 | 1 | 749034730 | |||
| 12 | 325104099 | 1064611782 | 1545065478 | 1308390270 | 716250645 | 265315644 | 67646172 | 11841588 | 1394415 | 105930 | 4818 | 114 | 1 | 5305730956 | ||
| 13 | 1814825418 | 6464582943 | 10304332272 | 9695594766 | 5981712594 | 2541595485 | 760150248 | 160718844 | 23777754 | 2399683 | 157872 | 6266 | 130 | 1 | 37749854276 | |
| 14 | 10164034152 | 39132819495 | 67977527982 | 70389981753 | 48357032724 | 23209829643 | 7982514540 | 1985203935 | 355795440 | 45260215 | 3969966 | 228865 | 8008 | 147 | 1 | 269604206866 |
Compute more
?
Technical details
- Node id
n-f772ba7716013345· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-7b6c44b627d65933
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: 4, 1; 2: 18, 9, 1; 3: 87, 66, 15, 1; 4: 439, 450, 158, 22, 1; 5: 2278, 2955, 1420, 310, 30, 1; 6: 12052, 18963, 11640, 3515, 540, 39, 1; 7: 64669, 119812, 89838, 34930, 7490, 868, 49, 1; 8: 350733, 748548, 664552, 317576, 88284, 14392, 1316, 60, 1; 9: 1918152, 4637205, 4763412, 2708328, 930384, 197820, 25620, 1908, 72, 1;
%F FormulaThe row polynomials satisfy (n^3+5*n^2+6*n+(2*n^2+5*n+2)*x+(n+2)*x^2)*P(n,x) = (7*n^3+29*n^2+12*n+(3*n^3+25*n^2+18*n+2)*x+(6*n^2+13*n+2)*x^2+3*n*x^3)*P(n-1,x) - (4*n^2+18*n+12+(6*n^2+35*n+30)*x+(2*n^2+21*n+28)*x^2+(4*n+12)*x^3+2*x^4)*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[((7*n^3 + 29*n^2 + 12*n + (3*n^3 + 25*n^2 + 18*n + 2)*x + (6*n^2 + 13*n + 2)*x^2 + 3*n*x^3)*P[n - 1, x] - (4*n^2 + 18*n + 12 + (6*n^2 + 35*n + 30)*x + (2*n^2 + 21*n + 28)*x^2 + (4*n + 12)*x^3 + 2*x^4)*D[P[n - 1, x], x])/(n^3 + 5*n^2 + 6*n + (2*n^2 + 5*n + 2)*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] = ((7*n^3 + 29*n^2 + 12*n + (3*n^3 + 25*n^2 + 18*n + 2)*x + (6*n^2 + 13*n + 2)*x^2 + 3*n*x^3)*v[i - 1] - (4*n^2 + 18*n + 12 + (6*n^2 + 35*n + 30)*x + (2*n^2 + 21*n + 28)*x^2 + (4*n + 12)*x^3 + 2*x^4)*deriv(v[i - 1], x))/(n^3 + 5*n^2 + 6*n + (2*n^2 + 5*n + 2)*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 (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Laguerre’s theorem on differential operators
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on differential operators
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
basis_map_A007318 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 …?
-
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) (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 …?
-
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) (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_A007318 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