A033282 → x ↦ x+1 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-8 - 4\,n + 2\,n x^{2} + 3\,n^{2} x^{2} + n^{3} x^{2}\right)\,P_{n}(x) = \left(-24 - 24\,x + 4\,x^{3} - 12\,n - 20\,n x + 6\,n x^{2} + 10\,n x^{3} - 4\,n^{2} x + 9\,n^{2} x^{2} + 8\,n^{2} x^{3} + 3\,n^{3} x^{2} + 2\,n^{3} x^{3}\right)\,P_{n-1}(x) + \left(-8 - 12\,x + 6\,x^{3} + 2\,x^{4} + 8\,n x^{2} + 12\,n x^{3} + 4\,n x^{4} + 4\,n^{2} x^{2} + 6\,n^{2} x^{3} + 2\,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 | 4 | 7 | |||||||||||||
| 2 | 11 | 30 | 15 | 56 | ||||||||||||
| 3 | 45 | 186 | 189 | 56 | 476 | |||||||||||
| 4 | 197 | 1092 | 1680 | 1008 | 210 | 4187 | ||||||||||
| 5 | 903 | 6280 | 12960 | 11760 | 4950 | 792 | 37645 | |||||||||
| 6 | 4279 | 35802 | 92745 | 112860 | 71775 | 23166 | 3003 | 343630 | ||||||||
| 7 | 20793 | 203350 | 634095 | 968660 | 825825 | 402402 | 105105 | 11440 | 3171670 | |||||||
| 8 | 103049 | 1153416 | 4206048 | 7735728 | 8278270 | 5405400 | 2130128 | 466752 | 43758 | 29522549 | ||||||
| 9 | 518859 | 6540876 | 27310608 | 58753968 | 75700170 | 62034336 | 32746896 | 10820160 | 2040714 | 167960 | 276634547 | |||||
| 10 | 2646723 | 37106550 | 174565755 | 430106040 | 648265800 | 639566928 | 423630480 | 187443360 | 53285310 | 8817900 | 646646 | 2606081492 | ||||
| 11 | 13648869 | 210649362 | 1102483305 | 3061267440 | 5284956600 | 6099542064 | 4863573792 | 2699711520 | 1027421010 | 256171300 | 37754178 | 2496144 | 24659675584 | |||
| 12 | 71039373 | 1196815500 | 6897480480 | 21311627040 | 41469288300 | 54823415328 | 51136765680 | 34166784960 | 16309229310 | 5442485400 | 1208133696 | 160466400 | 9657700 | 234203189167 | ||
| 13 | 372693519 | 6805767696 | 42827211648 | 145741678368 | 315608513220 | 470314134576 | 502506020016 | 392732134080 | 225623380554 | 94421401360 | 28045960800 | 5609192160 | 677970540 | 37442160 | 2231323500697 | |
| 14 | 1968801519 | 38735977266 | 264275122293 | 982152868788 | 2342819473995 | 3885686114310 | 4679864722533 | 4189531120632 | 2815186617243 | 1417755188850 | 528023641145 | 141278630220 | 25706382975 | 2850284430 | 145422675 | 21315980368874 |
Compute more
?
Technical details
- Node id
n-ff5afdbf2a55582c· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-8e8ddef9357b0015
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, 4; 2: 11, 30, 15; 3: 45, 186, 189, 56; 4: 197, 1092, 1680, 1008, 210; 5: 903, 6280, 12960, 11760, 4950, 792; 6: 4279, 35802, 92745, 112860, 71775, 23166, 3003; 7: 20793, 203350, 634095, 968660, 825825, 402402, 105105, 11440; 8: 103049, 1153416, 4206048, 7735728, 8278270, 5405400, 2130128, 466752, 43758; 9: 518859, 6540876, 27310608, 58753968, 75700170, 62034336, 32746896, 10820160, 2040714, 167960;
%F FormulaThe row polynomials satisfy -(4*n+8-(n^3+3*n^2+2*n)*x^2)*P(n,x) = -(12*n+24+(4*n^2+20*n+24)*x-(3*n^3+9*n^2+6*n)*x^2-(2*n^3+8*n^2+10*n+4)*x^3)*P(n-1,x) - (8+12*x-(4*n^2+8*n)*x^2-(6*n^2+12*n+6)*x^3-(2*n^2+4*n+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[(-(12*n + 24 + (4*n^2 + 20*n + 24)*x - (3*n^3 + 9*n^2 + 6*n)*x^2 - (2*n^3 + 8*n^2 + 10*n + 4)*x^3)*P[n - 1, x] - (8 + 12*x - (4*n^2 + 8*n)*x^2 - (6*n^2 + 12*n + 6)*x^3 - (2*n^2 + 4*n + 2)*x^4)*D[P[n - 1, x], x])/(-4*n - 8 + (n^3 + 3*n^2 + 2*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] = (-(12*n + 24 + (4*n^2 + 20*n + 24)*x - (3*n^3 + 9*n^2 + 6*n)*x^2 - (2*n^3 + 8*n^2 + 10*n + 4)*x^3)*v[i - 1] - (8 + 12*x - (4*n^2 + 8*n)*x^2 - (6*n^2 + 12*n + 6)*x^3 - (2*n^2 + 4*n + 2)*x^4)*deriv(v[i - 1], x))/(-4*n - 8 + (n^3 + 3*n^2 + 2*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
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
basis_map_A007318 of Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 re…?
-
Geometric basis map (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 ›
-
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…?
-
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 …?
-
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 ›
-
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.?
- ↑ 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 ›
-
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)
-
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) 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)
- ↑ 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.?
-
Geometric basis map (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) (above)
- ↑ 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.?
-
-
from
basis_map_A007318 of Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 re…?
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