A114687 → basis A013609 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(4 + 16\,x + 2\,n + 24\,n x + 16\,n x^{2} + 8\,n^{2} x + 24\,n^{2} x^{2} + 8\,n^{3} x^{2}\right)\,P_{n}(x) = \left(4 + 16\,x + 14\,n + 112\,n x + 208\,n x^{2} + 64\,n x^{3} + 64\,n^{2} x + 264\,n^{2} x^{2} + 224\,n^{2} x^{3} + 56\,n^{3} x^{2} + 96\,n^{3} x^{3}\right)\,P_{n-1}(x) + \left(-1 - 14\,x - 64\,x^{2} - 112\,x^{3} - 64\,x^{4} - 8\,n x - 68\,n x^{2} - 184\,n x^{3} - 160\,n x^{4} - 8\,n^{2} x^{2} - 48\,n^{2} x^{3} - 64\,n^{2} x^{4}\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 | 8 | 11 | |||||||||||||
| 2 | 11 | 56 | 48 | 115 | ||||||||||||
| 3 | 45 | 336 | 576 | 256 | 1213 | |||||||||||
| 4 | 197 | 1936 | 4992 | 4608 | 1280 | 13013 | ||||||||||
| 5 | 903 | 11000 | 37920 | 53760 | 32000 | 6144 | 141727 | |||||||||
| 6 | 4279 | 62184 | 268560 | 515840 | 480000 | 202752 | 28672 | 1562287 | ||||||||
| 7 | 20793 | 351008 | 1822464 | 4426240 | 5644800 | 3784704 | 1204224 | 131072 | 17385305 | |||||||
| 8 | 103049 | 1981472 | 12020736 | 35338240 | 57451520 | 53329920 | 27295744 | 6815744 | 589824 | 194926249 | ||||||
| 9 | 518859 | 11194344 | 77709888 | 268326912 | 531256320 | 633249792 | 452788224 | 184025088 | 37158912 | 2621440 | 2198849779 | |||||
| 10 | 2646723 | 63311640 | 494958960 | 1963783680 | 4588416000 | 6697377792 | 6189711360 | 3542876160 | 1176698880 | 196608000 | 11534336 | 24927923531 | ||||
| 11 | 13648869 | 358503024 | 3116900160 | 13973963520 | 37659072000 | 65149894656 | 74100719616 | 55148544000 | 25984696320 | 7208960000 | 1015021568 | 50331648 | 283780255381 | |||
| 12 | 71039373 | 2032517808 | 19453129344 | 97262246400 | 297107078400 | 594905997312 | 805150359552 | 740833099776 | 456337981440 | 180800716800 | 42630905856 | 5133828096 | 218103808 | 3241937003965 | ||
| 13 | 372693519 | 11537055192 | 120538825056 | 665011776000 | 2271325605120 | 5169855854592 | 8124438626304 | 8927731777536 | 6827629805568 | 3554103787520 | 1204069335040 | 244712472576 | 25518145536 | 939524096 | 37147785283655 | |
| 14 | 1968801519 | 65561861064 | 742502084688 | 4480745348352 | 16923862475520 | 43174213834752 | 77332095160320 | 98966570926080 | 90696419573760 | 58844577792000 | 26313038495744 | 7726763606016 | 1369473810432 | 124956704768 | 4026531840 | 426766777006855 |
Compute more
?
Technical details
- Node id
n-cd60910732cfe94d· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-b7bf3ce8c69857a4
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, 8; 2: 11, 56, 48; 3: 45, 336, 576, 256; 4: 197, 1936, 4992, 4608, 1280; 5: 903, 11000, 37920, 53760, 32000, 6144; 6: 4279, 62184, 268560, 515840, 480000, 202752, 28672; 7: 20793, 351008, 1822464, 4426240, 5644800, 3784704, 1204224, 131072; 8: 103049, 1981472, 12020736, 35338240, 57451520, 53329920, 27295744, 6815744, 589824; 9: 518859, 11194344, 77709888, 268326912, 531256320, 633249792, 452788224, 184025088, 37158912, 2621440;
%F FormulaThe row polynomials satisfy (2*n+4+(8*n^2+24*n+16)*x+(8*n^3+24*n^2+16*n)*x^2)*P(n,x) = (14*n+4+(64*n^2+112*n+16)*x+(56*n^3+264*n^2+208*n)*x^2+(96*n^3+224*n^2+64*n)*x^3)*P(n-1,x) - (1+(8*n+14)*x+(8*n^2+68*n+64)*x^2+(48*n^2+184*n+112)*x^3+(64*n^2+160*n+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[((14*n + 4 + (64*n^2 + 112*n + 16)*x + (56*n^3 + 264*n^2 + 208*n)*x^2 + (96*n^3 + 224*n^2 + 64*n)*x^3)*P[n - 1, x] - (1 + (8*n + 14)*x + (8*n^2 + 68*n + 64)*x^2 + (48*n^2 + 184*n + 112)*x^3 + (64*n^2 + 160*n + 64)*x^4)*D[P[n - 1, x], x])/(2*n + 4 + (8*n^2 + 24*n + 16)*x + (8*n^3 + 24*n^2 + 16*n)*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 + 4 + (64*n^2 + 112*n + 16)*x + (56*n^3 + 264*n^2 + 208*n)*x^2 + (96*n^3 + 224*n^2 + 64*n)*x^3)*v[i - 1] - (1 + (8*n + 14)*x + (8*n^2 + 68*n + 64)*x^2 + (48*n^2 + 184*n + 112)*x^3 + (64*n^2 + 160*n + 64)*x^4)*deriv(v[i - 1], x))/(2*n + 4 + (8*n^2 + 24*n + 16)*x + (8*n^3 + 24*n^2 + 16*n)*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 multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on multiplier sequences
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] 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