A026729 → basis A013610 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(3 + 225\,x + 135\,x^{2} - 81\,x^{3} + 60\,n - 306\,n x - 216\,n x^{2} + 81\,n x^{3} - 90\,n^{2} + 81\,n^{2} x + 81\,n^{2} x^{2} + 27\,n^{3}\right)\,P_{n}(x) = \left(300 - 675\,x - 783\,x^{2} + 243\,x^{3} + 243\,x^{4} - 822\,n + 18\,n x + 675\,n x^{2} + 81\,n x^{3} + 423\,n^{2} + 81\,n^{2} x - 162\,n^{2} x^{2} - 54\,n^{3}\right)\,P_{n-1}(x) + \left(40 - 6\,x - 423\,x^{2} + 27\,x^{3} + 567\,x^{4} + 243\,x^{5} - 105\,n - 243\,n x + 432\,n x^{2} + 729\,n x^{3} + 243\,n x^{4} + 45\,n^{2} + 162\,n^{2} x + 81\,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 | 4 | 3 | 7 | ||||||
| 3 | 11 | 27 | 9 | 47 | |||||
| 4 | 24 | 111 | 126 | 27 | 288 | ||||
| 5 | 50 | 333 | 711 | 513 | 81 | 1688 | |||
| 6 | 98 | 864 | 2736 | 3699 | 1944 | 243 | 9584 | ||
| 7 | 187 | 2046 | 8631 | 17469 | 17091 | 7047 | 729 | 53200 | |
| 8 | 348 | 4557 | 24066 | 65313 | 95904 | 73143 | 24786 | 2187 | 290304 |
Compute more
?
Technical details
- Node id
n-cc2d6f4d77b24cb6· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-4ff62ab1125a6851
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 -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: 4, 3; 3: 11, 27, 9; 4: 24, 111, 126, 27; 5: 50, 333, 711, 513, 81; 6: 98, 864, 2736, 3699, 1944, 243; 7: 187, 2046, 8631, 17469, 17091, 7047, 729; 8: 348, 4557, 24066, 65313, 95904, 73143, 24786, 2187; 9: 637, 9711, 61659, 210519, 416016, 476037, 296703, 85293, 6561; 10: 1150, 20013, 148536, 612063, 1526526, 2354670, 2198664, 1156923, 288684, 19683;
%F FormulaThe row polynomials satisfy (27*n^3-90*n^2+60*n+3+(81*n^2-306*n+225)*x+(81*n^2-216*n+135)*x^2+(81*n-81)*x^3)*P(n,x) = -(54*n^3-423*n^2+822*n-300-(81*n^2+18*n-675)*x+(162*n^2-675*n+783)*x^2-(81*n+243)*x^3-243*x^4)*P(n-1,x) + (45*n^2-105*n+40+(162*n^2-243*n-6)*x+(81*n^2+432*n-423)*x^2+(729*n+27)*x^3+(243*n+567)*x^4+243*x^5)*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[(-(54*n^3 - 423*n^2 + 822*n - 300 - (81*n^2 + 18*n - 675)*x + (162*n^2 - 675*n + 783)*x^2 - (81*n + 243)*x^3 - 243*x^4)*P[n - 1, x] + (45*n^2 - 105*n + 40 + (162*n^2 - 243*n - 6)*x + (81*n^2 + 432*n - 423)*x^2 + (729*n + 27)*x^3 + (243*n + 567)*x^4 + 243*x^5)*D[P[n - 1, x], x])/(27*n^3 - 90*n^2 + 60*n + 3 + (81*n^2 - 306*n + 225)*x + (81*n^2 - 216*n + 135)*x^2 + (81*n - 81)*x^3)]];
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] = (-(54*n^3 - 423*n^2 + 822*n - 300 - (81*n^2 + 18*n - 675)*x + (162*n^2 - 675*n + 783)*x^2 - (81*n + 243)*x^3 - 243*x^4)*v[i - 1] + (45*n^2 - 105*n + 40 + (162*n^2 - 243*n - 6)*x + (81*n^2 + 432*n - 423)*x^2 + (729*n + 27)*x^3 + (243*n + 567)*x^4 + 243*x^5)*deriv(v[i - 1], x))/(27*n^3 - 90*n^2 + 60*n + 3 + (81*n^2 - 306*n + 225)*x + (81*n^2 - 216*n + 135)*x^2 + (81*n - 81)*x^3)); 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 downward ant…?
-
Geometric basis map (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.?
-
Geometric basis map (elementary) polytool ? step ›
-
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 downward ant…?
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.