A033282 → θ+1 → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(2\,n + 2\,n x + n^{2} - 7\,n^{2} x - 12\,n^{3} x + 2\,n^{3} x^{2} - 4\,n^{4} x + 5\,n^{4} x^{2} + 4\,n^{5} x^{2} + n^{6} x^{2}\right)\,P_{n}(x) = \left(16\,x - 28\,x^{2} + 4\,x^{3} + 2\,n + 26\,n x - 98\,n x^{2} + 22\,n x^{3} + n^{2} + n^{2} x - 126\,n^{2} x^{2} + 50\,n^{2} x^{3} - 12\,n^{3} x - 68\,n^{3} x^{2} + 60\,n^{3} x^{3} - 4\,n^{4} x - 9\,n^{4} x^{2} + 40\,n^{4} x^{3} + 4\,n^{5} x^{2} + 14\,n^{5} x^{3} + n^{6} x^{2} + 2\,n^{6} x^{3}\right)\,P_{n-1}(x) + \left(2\,x - 6\,x^{2} - 6\,x^{3} + 2\,x^{4} + 2\,n x - 22\,n x^{2} - 14\,n x^{3} + 10\,n x^{4} - 24\,n^{2} x^{2} - 4\,n^{2} x^{3} + 20\,n^{2} x^{4} - 8\,n^{3} x^{2} + 12\,n^{3} x^{3} + 20\,n^{3} x^{4} + 10\,n^{4} x^{3} + 10\,n^{4} x^{4} + 2\,n^{5} x^{3} + 2\,n^{5} 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 | 1 | 16 | 17 | |||||||||||||
| 2 | 1 | 40 | 135 | 176 | ||||||||||||
| 3 | 1 | 72 | 567 | 896 | 1536 | |||||||||||
| 4 | 1 | 112 | 1512 | 5376 | 5250 | 12251 | ||||||||||
| 5 | 1 | 160 | 3240 | 19200 | 41250 | 28512 | 92363 | |||||||||
| 6 | 1 | 216 | 6075 | 52800 | 185625 | 277992 | 147147 | 669856 | ||||||||
| 7 | 1 | 280 | 10395 | 123200 | 625625 | 1513512 | 1716715 | 732160 | 4721888 | |||||||
| 8 | 1 | 352 | 16632 | 256256 | 1751750 | 6054048 | 10986976 | 9957376 | 3544398 | 32567789 | ||||||
| 9 | 1 | 432 | 25272 | 489216 | 4299750 | 19813248 | 50939616 | 73322496 | 55099278 | 16796000 | 220785309 | |||||
| 10 | 1 | 520 | 36855 | 873600 | 9555000 | 56137536 | 191023560 | 386979840 | 459160650 | 293930000 | 78244166 | 1475941728 | ||||
| 11 | 1 | 616 | 51975 | 1478400 | 19635000 | 142502976 | 614214216 | 1637222400 | 2719643850 | 2735810000 | 1522751846 | 359444736 | 9752756016 | |||
| 12 | 1 | 720 | 71280 | 2393600 | 37867500 | 331537536 | 1754897760 | 5894000640 | 12821178150 | 17978180000 | 15662590416 | 7702387200 | 1632151300 | 63817256103 | ||
| 13 | 1 | 832 | 95472 | 3734016 | 69283500 | 718331328 | 4562734176 | 18729824256 | 51113763558 | 93486536000 | 113118708560 | 86780229120 | 38192340420 | 7338663360 | 414114244599 | |
| 14 | 1 | 952 | 125307 | 5643456 | 121246125 | 1466593128 | 10979079111 | 53848244736 | 178898172453 | 409003595000 | 643362654935 | 683394304320 | 467856170145 | 186218582760 | 32720101875 | 2667874514304 |
Compute more
?
Technical details
- Node id
n-cec7a3928f1692d4· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-720047eeef937849
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: 1, 16; 2: 1, 40, 135; 3: 1, 72, 567, 896; 4: 1, 112, 1512, 5376, 5250; 5: 1, 160, 3240, 19200, 41250, 28512; 6: 1, 216, 6075, 52800, 185625, 277992, 147147; 7: 1, 280, 10395, 123200, 625625, 1513512, 1716715, 732160; 8: 1, 352, 16632, 256256, 1751750, 6054048, 10986976, 9957376, 3544398; 9: 1, 432, 25272, 489216, 4299750, 19813248, 50939616, 73322496, 55099278, 16796000;
%F FormulaThe row polynomials satisfy (n^2+2*n-(4*n^4+12*n^3+7*n^2-2*n)*x+(n^6+4*n^5+5*n^4+2*n^3)*x^2)*P(n,x) = (n^2+2*n-(4*n^4+12*n^3-n^2-26*n-16)*x+(n^6+4*n^5-9*n^4-68*n^3-126*n^2-98*n-28)*x^2+(2*n^6+14*n^5+40*n^4+60*n^3+50*n^2+22*n+4)*x^3)*P(n-1,x) + ((2*n+2)*x-(8*n^3+24*n^2+22*n+6)*x^2+(2*n^5+10*n^4+12*n^3-4*n^2-14*n-6)*x^3+(2*n^5+10*n^4+20*n^3+20*n^2+10*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[((n^2 + 2*n - (4*n^4 + 12*n^3 - n^2 - 26*n - 16)*x + (n^6 + 4*n^5 - 9*n^4 - 68*n^3 - 126*n^2 - 98*n - 28)*x^2 + (2*n^6 + 14*n^5 + 40*n^4 + 60*n^3 + 50*n^2 + 22*n + 4)*x^3)*P[n - 1, x] + ((2*n + 2)*x - (8*n^3 + 24*n^2 + 22*n + 6)*x^2 + (2*n^5 + 10*n^4 + 12*n^3 - 4*n^2 - 14*n - 6)*x^3 + (2*n^5 + 10*n^4 + 20*n^3 + 20*n^2 + 10*n + 2)*x^4)*D[P[n - 1, x], x])/(n^2 + 2*n - (4*n^4 + 12*n^3 + 7*n^2 - 2*n)*x + (n^6 + 4*n^5 + 5*n^4 + 2*n^3)*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] = ((n^2 + 2*n - (4*n^4 + 12*n^3 - n^2 - 26*n - 16)*x + (n^6 + 4*n^5 - 9*n^4 - 68*n^3 - 126*n^2 - 98*n - 28)*x^2 + (2*n^6 + 14*n^5 + 40*n^4 + 60*n^3 + 50*n^2 + 22*n + 4)*x^3)*v[i - 1] + ((2*n + 2)*x - (8*n^3 + 24*n^2 + 22*n + 6)*x^2 + (2*n^5 + 10*n^4 + 12*n^3 - 4*n^2 - 14*n - 6)*x^3 + (2*n^5 + 10*n^4 + 20*n^3 + 20*n^2 + 10*n + 2)*x^4)*deriv(v[i - 1], x))/(n^2 + 2*n - (4*n^4 + 12*n^3 + 7*n^2 - 2*n)*x + (n^6 + 4*n^5 + 5*n^4 + 2*n^3)*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
theta_plus_one of Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regio…?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] 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.?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] 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
theta_plus_one of Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regio…?
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