A391403 → x ↦ x+1 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(6\,n + 5\,n x + 4\,n^{2} x + n^{2} x^{2} + n^{3} x^{2}\right)\,P_{n}(x) = \left(-24 - 56\,x - 40\,x^{2} - 8\,x^{3} + 30\,n + 39\,n x + 4\,n x^{2} - 4\,n x^{3} + 26\,n^{2} x + 33\,n^{2} x^{2} + 8\,n^{2} x^{3} + 5\,n^{3} x^{2} + 4\,n^{3} x^{3}\right)\,P_{n-1}(x) + \left(-18 - 72\,x - 106\,x^{2} - 68\,x^{3} - 16\,x^{4} - 24\,n x - 74\,n x^{2} - 74\,n x^{3} - 24\,n x^{4} - 6\,n^{2} x^{2} - 14\,n^{2} x^{3} - 8\,n^{2} x^{4}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 1 | 1 | |||||||
| 2 | 3 | 4 | 7 | ||||||
| 3 | 7 | 12 | 19 | ||||||
| 4 | 19 | 48 | 18 | 85 | |||||
| 5 | 51 | 160 | 90 | 301 | |||||
| 6 | 141 | 540 | 450 | 80 | 1211 | ||||
| 7 | 393 | 1764 | 1890 | 560 | 4607 | ||||
| 8 | 1107 | 5712 | 7560 | 3360 | 350 | 18089 | |||
| 9 | 3139 | 18288 | 28728 | 16800 | 3150 | 70105 | |||
| 10 | 8953 | 58140 | 105840 | 77280 | 22050 | 1512 | 273775 | ||
| 11 | 25653 | 183700 | 380160 | 332640 | 127050 | 16632 | 1065835 | ||
| 12 | 73789 | 577632 | 1339470 | 1367520 | 658350 | 133056 | 6468 | 4156285 | |
| 13 | 212941 | 1808976 | 4646070 | 5422560 | 3153150 | 864864 | 84084 | 16192645 | |
| 14 | 616227 | 5646004 | 15909894 | 20900880 | 14264250 | 4972968 | 756756 | 27456 | 63094435 |
Compute more
?
Technical details
- Node id
n-6fc79809541bd4b3· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-975d9965822ff143
Observed on the stored rows ?
- Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half 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; 2: 3, 4; 3: 7, 12; 4: 19, 48, 18; 5: 51, 160, 90; 6: 141, 540, 450, 80; 7: 393, 1764, 1890, 560; 8: 1107, 5712, 7560, 3360, 350; 9: 3139, 18288, 28728, 16800, 3150;
%F FormulaThe row polynomials satisfy (6*n+(4*n^2+5*n)*x+(n^3+n^2)*x^2)*P(n,x) = (30*n-24+(26*n^2+39*n-56)*x+(5*n^3+33*n^2+4*n-40)*x^2+(4*n^3+8*n^2-4*n-8)*x^3)*P(n-1,x) - (18+(24*n+72)*x+(6*n^2+74*n+106)*x^2+(14*n^2+74*n+68)*x^3+(8*n^2+24*n+16)*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[((30*n - 24 + (26*n^2 + 39*n - 56)*x + (5*n^3 + 33*n^2 + 4*n - 40)*x^2 + (4*n^3 + 8*n^2 - 4*n - 8)*x^3)*P[n - 1, x] - (18 + (24*n + 72)*x + (6*n^2 + 74*n + 106)*x^2 + (14*n^2 + 74*n + 68)*x^3 + (8*n^2 + 24*n + 16)*x^4)*D[P[n - 1, x], x])/(6*n + (4*n^2 + 5*n)*x + (n^3 + n^2)*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] = ((30*n - 24 + (26*n^2 + 39*n - 56)*x + (5*n^3 + 33*n^2 + 4*n - 40)*x^2 + (4*n^3 + 8*n^2 - 4*n - 8)*x^3)*v[i - 1] - (18 + (24*n + 72)*x + (6*n^2 + 74*n + 106)*x^2 + (14*n^2 + 74*n + 68)*x^3 + (8*n^2 + 24*n + 16)*x^4)*deriv(v[i - 1], x))/(6*n + (4*n^2 + 5*n)*x + (n^3 + n^2)*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
shift_x_plus_one of Triangle read by rows: T(n,k) is k-th entry of the gamma-vector of the n-dimensional cyclohedron, 0…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is k-th entry of the gamma-vector of the n-dimensional cyclohedron, 0 <= k <= floor(n/2).?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangular array of Motzkin polynomial coefficients.?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
narayana?
-
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
narayana?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? 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…?
-
Pólya–Schur theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
delannoy?
-
Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
delannoy?
- ↑ Liu–Wang theorem with a lag row (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
delannoy?
- ↑ Liu–Wang theorem with a lag row (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
from
delannoy?
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
delannoy?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
-
from
delannoy?
-
from
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…?
-
-
from
Triangular array of Motzkin polynomial coefficients.?
-
Pólya–Schur theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
Square the entries of Pascal's triangle.?
-
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
Square the entries of Pascal's triangle.?
-
-
from
Triangle read by rows: T(n,k) is k-th entry of the gamma-vector of the n-dimensional cyclohedron, 0 <= k <= floor(n/2).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is k-th entry of the gamma-vector of the n-dimensional cyclohedron, 0 <= k <= floor(n/2).?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
from
Triangle read by rows: T(n,k) is k-th entry of the gamma-vector of the n-dimensional cyclohedron, 0 <= k <= floor(n/2).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is k-th entry of the gamma-vector of the n-dimensional cyclohedron, 0 <= k <= floor(n/2).?
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Pólya–Schur theorem on multiplier sequences (above)
- ↑ Laguerre’s theorem on multiplier sequences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
from
Triangle read by rows: T(n,k) is k-th entry of the gamma-vector of the n-dimensional cyclohedron, 0 <= k <= floor(n/2).?
-
-
from
shift_x_plus_one of Triangle read by rows: T(n,k) is k-th entry of the gamma-vector of the n-dimensional cyclohedron, 0…?
Related ?
Same fingerprint ?
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