A114687 → basis A013609 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-6 - 20\,x + 16\,x^{2} - 3\,n + 22\,n x + 8\,n x^{2} + 16\,n^{2} + 16\,n^{2} x + 8\,n^{3}\right)\,P_{n}(x) = \left(-6 - 20\,x + 16\,x^{2} - 9\,n - 66\,n x + 32\,n x^{2} + 96\,n x^{3} + 64\,n^{2} + 176\,n^{2} x + 192\,n^{2} x^{2} + 56\,n^{3} + 96\,n^{3} x\right)\,P_{n-1}(x) + \left(-3 - 24\,x - 68\,x^{2} - 96\,x^{3} - 64\,x^{4} - 12\,n - 88\,n x - 192\,n x^{2} - 128\,n x^{3} - 8\,n^{2} - 48\,n^{2} x - 64\,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 | 7 | 4 | 11 | |||||||||||||
| 2 | 39 | 60 | 16 | 115 | ||||||||||||
| 3 | 213 | 552 | 384 | 64 | 1213 | |||||||||||
| 4 | 1165 | 4296 | 5120 | 2176 | 256 | 13013 | ||||||||||
| 5 | 6403 | 30780 | 52960 | 39040 | 11520 | 1024 | 141727 | |||||||||
| 6 | 35371 | 210132 | 476400 | 512960 | 264960 | 58368 | 4096 | 1562287 | ||||||||
| 7 | 196297 | 1390480 | 3927168 | 5622400 | 4282880 | 1662976 | 286720 | 16384 | 17385305 | |||||||
| 8 | 1093785 | 9004560 | 30510592 | 54795776 | 55931904 | 32284672 | 9863168 | 1376256 | 65536 | 194926249 | ||||||
| 9 | 6116031 | 57403764 | 227148480 | 492086784 | 633959424 | 493645824 | 225705984 | 56033280 | 6488064 | 262144 | 2198849779 | |||||
| 10 | 34302543 | 361628460 | 1637824080 | 4161678720 | 6498831360 | 6421696512 | 3984261120 | 1488814080 | 307691520 | 30146560 | 1048576 | 24927923531 | ||||
| 11 | 192900381 | 2257184952 | 11519439360 | 33620748480 | 61823393280 | 74373218304 | 58840793088 | 29991075840 | 9375252480 | 1643642880 | 138412032 | 4194304 | 283780255381 | |||
| 12 | 1087298277 | 13985011800 | 79431061248 | 262001224320 | 555176413440 | 789279879168 | 763250442240 | 498237898752 | 213424865280 | 56835440640 | 8581545984 | 629145600 | 16777216 | 3241937003965 | ||
| 13 | 6141221115 | 86127744300 | 538938440352 | 1983313428096 | 4762478333184 | 7825447179264 | 8972399394816 | 7184970743808 | 3957318942720 | 1450018865152 | 333780615168 | 43947917312 | 2835349504 | 67108864 | 37147785283655 | |
| 14 | 34749732051 | 527782320324 | 3608059706160 | 14659276317504 | 39363284024064 | 73480355300352 | 97643191726080 | 92989860986880 | 63037499965440 | 29805401866240 | 9474961047552 | 1908026638336 | 221375365120 | 12683575296 | 268435456 | 426766777006855 |
Compute more
?
Technical details
- Node id
n-cca2636b43e84f12· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-34bd435130f77bfa
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: 7, 4; 2: 39, 60, 16; 3: 213, 552, 384, 64; 4: 1165, 4296, 5120, 2176, 256; 5: 6403, 30780, 52960, 39040, 11520, 1024; 6: 35371, 210132, 476400, 512960, 264960, 58368, 4096; 7: 196297, 1390480, 3927168, 5622400, 4282880, 1662976, 286720, 16384; 8: 1093785, 9004560, 30510592, 54795776, 55931904, 32284672, 9863168, 1376256, 65536; 9: 6116031, 57403764, 227148480, 492086784, 633959424, 493645824, 225705984, 56033280, 6488064, 262144;
%F FormulaThe row polynomials satisfy (8*n^3+16*n^2-3*n-6+(16*n^2+22*n-20)*x+(8*n+16)*x^2)*P(n,x) = (56*n^3+64*n^2-9*n-6+(96*n^3+176*n^2-66*n-20)*x+(192*n^2+32*n+16)*x^2+96*n*x^3)*P(n-1,x) - (8*n^2+12*n+3+(48*n^2+88*n+24)*x+(64*n^2+192*n+68)*x^2+(128*n+96)*x^3+64*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[((56*n^3 + 64*n^2 - 9*n - 6 + (96*n^3 + 176*n^2 - 66*n - 20)*x + (192*n^2 + 32*n + 16)*x^2 + 96*n*x^3)*P[n - 1, x] - (8*n^2 + 12*n + 3 + (48*n^2 + 88*n + 24)*x + (64*n^2 + 192*n + 68)*x^2 + (128*n + 96)*x^3 + 64*x^4)*D[P[n - 1, x], x])/(8*n^3 + 16*n^2 - 3*n - 6 + (16*n^2 + 22*n - 20)*x + (8*n + 16)*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] = ((56*n^3 + 64*n^2 - 9*n - 6 + (96*n^3 + 176*n^2 - 66*n - 20)*x + (192*n^2 + 32*n + 16)*x^2 + 96*n*x^3)*v[i - 1] - (8*n^2 + 12*n + 3 + (48*n^2 + 88*n + 24)*x + (64*n^2 + 192*n + 68)*x^2 + (128*n + 96)*x^3 + 64*x^4)*deriv(v[i - 1], x))/(8*n^3 + 16*n^2 - 3*n - 6 + (16*n^2 + 22*n - 20)*x + (8*n + 16)*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_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