A008288 → basis A013610 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(144 - 72\,x + 864\,x^{2} + 243\,x^{3} - 243\,x^{4} - 252\,n + 342\,n x - 1269\,n x^{2} - 486\,n x^{3} + 243\,n x^{4} + 108\,n^{2} - 432\,n^{2} x + 405\,n^{2} x^{2} + 243\,n^{2} x^{3} + 162\,n^{3} x\right)\,P_{n}(x) = \left(480 - 648\,x - 5724\,x^{2} - 1701\,x^{3} + 1944\,x^{4} + 729\,x^{5} - 1860\,n - 3870\,n x + 3159\,n x^{2} + 2835\,n x^{3} + 1332\,n^{2} + 3348\,n^{2} x - 81\,n^{2} x^{2} - 729\,n^{2} x^{3} - 216\,n^{3} - 486\,n^{3} x\right)\,P_{n-1}(x) + \left(64 + 48\,x - 1152\,x^{2} - 1674\,x^{3} + 2349\,x^{4} + 2916\,x^{5} + 729\,x^{6} - 240\,n - 1080\,n x - 54\,n x^{2} + 4131\,n x^{3} + 3402\,n x^{4} + 729\,n x^{5} + 144\,n^{2} + 864\,n^{2} x + 1458\,n^{2} x^{2} + 486\,n^{2} x^{3}\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 | 5 | 3 | 8 | ||||||
| 3 | 20 | 33 | 9 | 62 | |||||
| 4 | 66 | 198 | 153 | 27 | 444 | ||||
| 5 | 203 | 894 | 1251 | 621 | 81 | 3050 | |||
| 6 | 595 | 3477 | 7227 | 6453 | 2349 | 243 | 20344 | ||
| 7 | 1690 | 12339 | 34326 | 45603 | 29646 | 8505 | 729 | 132838 | |
| 8 | 4692 | 41148 | 143982 | 256986 | 248184 | 126360 | 29889 | 2187 | 853428 |
Compute more
?
Technical details
- Node id
n-6870d0dead662dd7· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-5a8f3aa50606b336
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: 5, 3; 3: 20, 33, 9; 4: 66, 198, 153, 27; 5: 203, 894, 1251, 621, 81; 6: 595, 3477, 7227, 6453, 2349, 243; 7: 1690, 12339, 34326, 45603, 29646, 8505, 729; 8: 4692, 41148, 143982, 256986, 248184, 126360, 29889, 2187; 9: 12805, 131196, 554274, 1248966, 1622106, 1223748, 511029, 102789, 6561; 10: 34481, 404343, 2003922, 5469822, 8984682, 9112014, 5622777, 1987983, 347733, 19683;
%F FormulaThe row polynomials satisfy (108*n^2-252*n+144+(162*n^3-432*n^2+342*n-72)*x+(405*n^2-1269*n+864)*x^2+(243*n^2-486*n+243)*x^3+(243*n-243)*x^4)*P(n,x) = -(216*n^3-1332*n^2+1860*n-480+(486*n^3-3348*n^2+3870*n+648)*x+(81*n^2-3159*n+5724)*x^2+(729*n^2-2835*n+1701)*x^3-1944*x^4-729*x^5)*P(n-1,x) + (144*n^2-240*n+64+(864*n^2-1080*n+48)*x+(1458*n^2-54*n-1152)*x^2+(486*n^2+4131*n-1674)*x^3+(3402*n+2349)*x^4+(729*n+2916)*x^5+729*x^6)*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[(-(216*n^3 - 1332*n^2 + 1860*n - 480 + (486*n^3 - 3348*n^2 + 3870*n + 648)*x + (81*n^2 - 3159*n + 5724)*x^2 + (729*n^2 - 2835*n + 1701)*x^3 - 1944*x^4 - 729*x^5)*P[n - 1, x] + (144*n^2 - 240*n + 64 + (864*n^2 - 1080*n + 48)*x + (1458*n^2 - 54*n - 1152)*x^2 + (486*n^2 + 4131*n - 1674)*x^3 + (3402*n + 2349)*x^4 + (729*n + 2916)*x^5 + 729*x^6)*D[P[n - 1, x], x])/(108*n^2 - 252*n + 144 + (162*n^3 - 432*n^2 + 342*n - 72)*x + (405*n^2 - 1269*n + 864)*x^2 + (243*n^2 - 486*n + 243)*x^3 + (243*n - 243)*x^4)]];
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] = (-(216*n^3 - 1332*n^2 + 1860*n - 480 + (486*n^3 - 3348*n^2 + 3870*n + 648)*x + (81*n^2 - 3159*n + 5724)*x^2 + (729*n^2 - 2835*n + 1701)*x^3 - 1944*x^4 - 729*x^5)*v[i - 1] + (144*n^2 - 240*n + 64 + (864*n^2 - 1080*n + 48)*x + (1458*n^2 - 54*n - 1152)*x^2 + (486*n^2 + 4131*n - 1674)*x^3 + (3402*n + 2349)*x^4 + (729*n + 2916)*x^5 + 729*x^6)*deriv(v[i - 1], x))/(108*n^2 - 252*n + 144 + (162*n^3 - 432*n^2 + 342*n - 72)*x + (405*n^2 - 1269*n + 864)*x^2 + (243*n^2 - 486*n + 243)*x^3 + (243*n - 243)*x^4)); 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 Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
-
Geometric basis map (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 [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.?
-
Geometric basis map (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) (above)
- ↑ 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.?
-
-
from
basis_map_A013610 of Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.