A052553 → basis A013610 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-33 + 297\,x - 108\,x^{2} + 123\,n - 405\,n x + 108\,n x^{2} - 117\,n^{2} + 108\,n^{2} x + 27\,n^{3}\right)\,P_{n}(x) = \left(-75 + 765\,x + 1728\,x^{2} - 1296\,x^{3} + 450\,n + 9\,n x - 2106\,n x^{2} + 648\,n x^{3} - 378\,n^{2} - 540\,n^{2} x + 648\,n^{2} x^{2} + 81\,n^{3} + 162\,n^{3} x\right)\,P_{n-1}(x) + \left(-10 + 81\,x + 477\,x^{2} - 1296\,x^{4} + 60\,n + 144\,n x - 540\,n x^{2} - 1296\,n x^{3} - 45\,n^{2} - 243\,n^{2} x - 324\,n^{2} x^{2}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | |||||||
| 2 | 1 | 1 | |||||||
| 3 | 5 | 3 | 8 | ||||||
| 4 | 9 | 6 | 15 | ||||||
| 5 | 20 | 33 | 9 | 62 | |||||
| 6 | 38 | 84 | 27 | 149 | |||||
| 7 | 73 | 222 | 162 | 27 | 484 | ||||
| 8 | 135 | 510 | 522 | 108 | 1275 | ||||
| 9 | 247 | 1131 | 1593 | 702 | 81 | 3754 | |||
| 10 | 445 | 2388 | 4239 | 2700 | 405 | 10177 | |||
| 11 | 794 | 4899 | 10602 | 9315 | 2835 | 243 | 28688 | ||
| 12 | 1404 | 9792 | 25002 | 27972 | 12555 | 1458 | 78183 | ||
| 13 | 2465 | 19188 | 56592 | 77598 | 48195 | 10935 | 729 | 215702 | |
| 14 | 4301 | 36972 | 123768 | 201312 | 160461 | 54432 | 5103 | 586349 | |
| 15 | 7465 | 70251 | 263358 | 496800 | 487620 | 229635 | 40824 | 2187 | 1598140 |
Compute more
?
Technical details
- Node id
n-af136264cba93a0b· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-0eb52ff90756e31e
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 -1)
- 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 = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 1; 2: 1; 3: 5, 3; 4: 9, 6; 5: 20, 33, 9; 6: 38, 84, 27; 7: 73, 222, 162, 27; 8: 135, 510, 522, 108; 9: 247, 1131, 1593, 702, 81; 10: 445, 2388, 4239, 2700, 405;
%F FormulaThe row polynomials satisfy (27*n^3-117*n^2+123*n-33+(108*n^2-405*n+297)*x+(108*n-108)*x^2)*P(n,x) = (81*n^3-378*n^2+450*n-75+(162*n^3-540*n^2+9*n+765)*x+(648*n^2-2106*n+1728)*x^2+(648*n-1296)*x^3)*P(n-1,x) - (45*n^2-60*n+10+(243*n^2-144*n-81)*x+(324*n^2+540*n-477)*x^2+1296*n*x^3+1296*x^4)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t MathematicaP[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((81*n^3 - 378*n^2 + 450*n - 75 + (162*n^3 - 540*n^2 + 9*n + 765)*x + (648*n^2 - 2106*n + 1728)*x^2 + (648*n - 1296)*x^3)*P[n - 1, x] - (45*n^2 - 60*n + 10 + (243*n^2 - 144*n - 81)*x + (324*n^2 + 540*n - 477)*x^2 + 1296*n*x^3 + 1296*x^4)*D[P[n - 1, x], x])/(27*n^3 - 117*n^2 + 123*n - 33 + (108*n^2 - 405*n + 297)*x + (108*n - 108)*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = ((81*n^3 - 378*n^2 + 450*n - 75 + (162*n^3 - 540*n^2 + 9*n + 765)*x + (648*n^2 - 2106*n + 1728)*x^2 + (648*n - 1296)*x^3)*v[i - 1] - (45*n^2 - 60*n + 10 + (243*n^2 - 144*n - 81)*x + (324*n^2 + 540*n - 477)*x^2 + 1296*n*x^3 + 1296*x^4)*deriv(v[i - 1], x))/(27*n^3 - 117*n^2 + 123*n - 33 + (108*n^2 - 405*n + 297)*x + (108*n - 108)*x^2)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
derived from Laguerre’s theorem on differential operators
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on differential operators
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
basis_map_A013610 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antid…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
-
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
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ 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
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ 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
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
no recorded property covers this requirement
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
no recorded property covers this requirement
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
Affine, reversal and Möbius substitutions (elementary) 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…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.?
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
-
from
Triangle read by rows, T(n,k) = T(n-1,k) + T(n-2,k) + T(n-1,k-1) + T(n-2,k-1) and T(0,0) = 1.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
no recorded property covers this requirement
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
- ↑ Ma–Wang interval theorem (above)
-
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downward antidiagonals.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antidiagonals.?
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A013610 of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by upward antid…?
Related ?
Same fingerprint ?
References
- [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
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.