A114687 → basis A007318 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-2 - 2\,x + 4\,x^{2} + 3\,n + 7\,n x + 2\,n x^{2} + 6\,n^{2} + 4\,n^{2} x + 2\,n^{3}\right)\,P_{n}(x) = \left(-2 - 2\,x + 4\,x^{2} + 3\,n + 5\,n x + 20\,n x^{2} + 12\,n x^{3} + 30\,n^{2} + 48\,n^{2} x + 24\,n^{2} x^{2} + 14\,n^{3} + 12\,n^{3} x\right)\,P_{n-1}(x) + \left(-4 - 18\,x - 30\,x^{2} - 24\,x^{3} - 8\,x^{4} - 10\,n - 38\,n x - 44\,n x^{2} - 16\,n x^{3} - 4\,n^{2} - 12\,n^{2} x - 8\,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 | 5 | 2 | 7 | |||||||||||||
| 2 | 25 | 22 | 4 | 51 | ||||||||||||
| 3 | 129 | 180 | 72 | 8 | 389 | |||||||||||
| 4 | 681 | 1316 | 848 | 208 | 16 | 3069 | ||||||||||
| 5 | 3653 | 9070 | 8200 | 3280 | 560 | 32 | 24795 | |||||||||
| 6 | 19825 | 60306 | 70740 | 40120 | 11280 | 1440 | 64 | 203775 | ||||||||
| 7 | 108545 | 391496 | 566832 | 420560 | 169120 | 35840 | 3584 | 128 | 1696105 | |||||||
| 8 | 598417 | 2498824 | 4314688 | 3976896 | 2106944 | 643328 | 107520 | 8704 | 256 | 14255577 | ||||||
| 9 | 3317445 | 15750234 | 31631472 | 34948032 | 23131584 | 9362304 | 2268672 | 308736 | 20736 | 512 | 120739727 | |||||
| 10 | 18474633 | 98321070 | 225351300 | 290789040 | 231766080 | 117780096 | 38035200 | 7545600 | 856320 | 48640 | 1024 | 1028969003 | ||||
| 11 | 103274625 | 609109116 | 1569800760 | 2319639960 | 2167350240 | 1331742720 | 542395392 | 144080640 | 23950080 | 2309120 | 112640 | 2048 | 8813767341 | |||
| 12 | 579168825 | 3750317676 | 10739429712 | 17894799120 | 19206182160 | 13881732480 | 6861499392 | 2307976704 | 515877120 | 73159680 | 6082560 | 258048 | 4096 | 75816487573 | ||
| 13 | 3256957317 | 22974067974 | 72389756088 | 134347898256 | 163023232944 | 135735778464 | 79164324096 | 32425536000 | 9210829056 | 1763114496 | 216426496 | 15708160 | 585728 | 8192 | 654524223267 | |
| 14 | 18359266785 | 140140812714 | 481945050132 | 986216415912 | 1335876766224 | 1260563400096 | 849145577280 | 411565165440 | 142802499840 | 34853378560 | 5794460672 | 623028224 | 39882752 | 1318912 | 16384 | 5667927039927 |
Compute more
?
Technical details
- Node id
n-ea661d0f47f9120b· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-a3dcf688a708825c
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, 2; 2: 25, 22, 4; 3: 129, 180, 72, 8; 4: 681, 1316, 848, 208, 16; 5: 3653, 9070, 8200, 3280, 560, 32; 6: 19825, 60306, 70740, 40120, 11280, 1440, 64; 7: 108545, 391496, 566832, 420560, 169120, 35840, 3584, 128; 8: 598417, 2498824, 4314688, 3976896, 2106944, 643328, 107520, 8704, 256; 9: 3317445, 15750234, 31631472, 34948032, 23131584, 9362304, 2268672, 308736, 20736, 512;
%F FormulaThe row polynomials satisfy (2*n^3+6*n^2+3*n-2+(4*n^2+7*n-2)*x+(2*n+4)*x^2)*P(n,x) = (14*n^3+30*n^2+3*n-2+(12*n^3+48*n^2+5*n-2)*x+(24*n^2+20*n+4)*x^2+12*n*x^3)*P(n-1,x) - (4*n^2+10*n+4+(12*n^2+38*n+18)*x+(8*n^2+44*n+30)*x^2+(16*n+24)*x^3+8*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[((14*n^3 + 30*n^2 + 3*n - 2 + (12*n^3 + 48*n^2 + 5*n - 2)*x + (24*n^2 + 20*n + 4)*x^2 + 12*n*x^3)*P[n - 1, x] - (4*n^2 + 10*n + 4 + (12*n^2 + 38*n + 18)*x + (8*n^2 + 44*n + 30)*x^2 + (16*n + 24)*x^3 + 8*x^4)*D[P[n - 1, x], x])/(2*n^3 + 6*n^2 + 3*n - 2 + (4*n^2 + 7*n - 2)*x + (2*n + 4)*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] = ((14*n^3 + 30*n^2 + 3*n - 2 + (12*n^3 + 48*n^2 + 5*n - 2)*x + (24*n^2 + 20*n + 4)*x^2 + 12*n*x^3)*v[i - 1] - (4*n^2 + 10*n + 4 + (12*n^2 + 38*n + 18)*x + (8*n^2 + 44*n + 30)*x^2 + (16*n + 24)*x^3 + 8*x^4)*deriv(v[i - 1], x))/(2*n^3 + 6*n^2 + 3*n - 2 + (4*n^2 + 7*n - 2)*x + (2*n + 4)*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 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 ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
basis_map_A007318 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