A126216 → basis A007318 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(8 + 8\,x + 4\,n + 12\,n x + 2\,n x^{2} + 4\,n^{2} x + 3\,n^{2} x^{2} + n^{3} x^{2}\right)\,P_{n}(x) = \left(8 + 8\,x + 28\,n + 56\,n x + 26\,n x^{2} + 2\,n x^{3} + 32\,n^{2} x + 33\,n^{2} x^{2} + 7\,n^{2} x^{3} + 7\,n^{3} x^{2} + 3\,n^{3} x^{3}\right)\,P_{n-1}(x) + \left(-8 - 28\,x - 32\,x^{2} - 14\,x^{3} - 2\,x^{4} - 16\,n x - 34\,n x^{2} - 23\,n x^{3} - 5\,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 | 2 | 5 | |||||||||||||
| 2 | 11 | 14 | 3 | 28 | ||||||||||||
| 3 | 45 | 84 | 36 | 4 | 169 | |||||||||||
| 4 | 197 | 484 | 312 | 72 | 5 | 1070 | ||||||||||
| 5 | 903 | 2750 | 2370 | 840 | 125 | 6 | 6994 | |||||||||
| 6 | 4279 | 15546 | 16785 | 8060 | 1875 | 198 | 7 | 46750 | ||||||||
| 7 | 20793 | 87752 | 113904 | 69160 | 22050 | 3696 | 294 | 8 | 317657 | |||||||
| 8 | 103049 | 495368 | 751296 | 552160 | 224420 | 52080 | 6664 | 416 | 9 | 2185462 | ||||||
| 9 | 518859 | 2798586 | 4856868 | 4192608 | 2075220 | 618408 | 110544 | 11232 | 567 | 10 | 15182902 | |||||
| 10 | 2646723 | 15827910 | 30934935 | 30684120 | 17923500 | 6540408 | 1511160 | 216240 | 17955 | 750 | 11 | 106303712 | ||||
| 11 | 13648869 | 89625756 | 194806260 | 218343180 | 147105750 | 63622944 | 18090996 | 3366000 | 396495 | 27500 | 968 | 12 | 749034730 | |||
| 12 | 71039373 | 508129452 | 1215820584 | 1519722600 | 1160574525 | 580962888 | 196569912 | 45216864 | 6963165 | 689700 | 40656 | 1224 | 13 | 5305730956 | ||
| 13 | 372693519 | 2884263798 | 7533676566 | 10390809000 | 8872365645 | 5048687358 | 1983505524 | 544905504 | 104181363 | 13557830 | 1148290 | 58344 | 1521 | 14 | 37749854276 | |
| 14 | 1968801519 | 16390465266 | 46406380293 | 70011646068 | 66108837795 | 42162318198 | 18879906045 | 6040440120 | 1383917535 | 224474250 | 25094069 | 1842204 | 81627 | 1862 | 15 | 269604206866 |
Compute more
?
Technical details
- Node id
n-e75dc83934fd9c75· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-96b6926a4c90aeb1
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, 2; 2: 11, 14, 3; 3: 45, 84, 36, 4; 4: 197, 484, 312, 72, 5; 5: 903, 2750, 2370, 840, 125, 6; 6: 4279, 15546, 16785, 8060, 1875, 198, 7; 7: 20793, 87752, 113904, 69160, 22050, 3696, 294, 8; 8: 103049, 495368, 751296, 552160, 224420, 52080, 6664, 416, 9; 9: 518859, 2798586, 4856868, 4192608, 2075220, 618408, 110544, 11232, 567, 10;
%F FormulaThe row polynomials satisfy (4*n+8+(4*n^2+12*n+8)*x+(n^3+3*n^2+2*n)*x^2)*P(n,x) = (28*n+8+(32*n^2+56*n+8)*x+(7*n^3+33*n^2+26*n)*x^2+(3*n^3+7*n^2+2*n)*x^3)*P(n-1,x) - (8+(16*n+28)*x+(4*n^2+34*n+32)*x^2+(6*n^2+23*n+14)*x^3+(2*n^2+5*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[((28*n + 8 + (32*n^2 + 56*n + 8)*x + (7*n^3 + 33*n^2 + 26*n)*x^2 + (3*n^3 + 7*n^2 + 2*n)*x^3)*P[n - 1, x] - (8 + (16*n + 28)*x + (4*n^2 + 34*n + 32)*x^2 + (6*n^2 + 23*n + 14)*x^3 + (2*n^2 + 5*n + 2)*x^4)*D[P[n - 1, x], x])/(4*n + 8 + (4*n^2 + 12*n + 8)*x + (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] = ((28*n + 8 + (32*n^2 + 56*n + 8)*x + (7*n^3 + 33*n^2 + 26*n)*x^2 + (3*n^3 + 7*n^2 + 2*n)*x^3)*v[i - 1] - (8 + (16*n + 28)*x + (4*n^2 + 34*n + 32)*x^2 + (6*n^2 + 23*n + 14)*x^3 + (2*n^2 + 5*n + 2)*x^4)*deriv(v[i - 1], x))/(4*n + 8 + (4*n^2 + 12*n + 8)*x + (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
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 Schroeder paths of semilength n containing exactly …?
-
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 …?
-
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) (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 …?
-
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) (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 …?
-
-
from
basis_map_A007318 of Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly …?
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