A008288 → basis A013611 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(6 - 6\,x + 40\,x^{2} + 28\,x^{3} - 16\,x^{4} - 10\,n + 22\,n x - 56\,n x^{2} - 44\,n x^{3} + 16\,n x^{4} + 4\,n^{2} - 24\,n^{2} x + 16\,n^{2} x^{2} + 16\,n^{2} x^{3} + 8\,n^{3} x\right)\,P_{n}(x) = \left(28 + 40\,x - 256\,x^{2} - 208\,x^{3} + 80\,x^{4} + 64\,x^{5} - 80\,n - 270\,n x + 52\,n x^{2} + 196\,n x^{3} + 16\,n x^{4} + 52\,n^{2} + 184\,n^{2} x + 32\,n^{2} x^{2} - 48\,n^{2} x^{3} - 8\,n^{3} - 24\,n^{3} x\right)\,P_{n-1}(x) + \left(3 + 14\,x - 24\,x^{2} - 132\,x^{3} + 20\,x^{4} + 160\,x^{5} + 64\,x^{6} - 8\,n - 56\,n x - 72\,n x^{2} + 144\,n x^{3} + 208\,n x^{4} + 64\,n x^{5} + 4\,n^{2} + 32\,n^{2} x + 72\,n^{2} x^{2} + 32\,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 | 6 | 4 | 10 | ||||||
| 3 | 25 | 52 | 16 | 93 | |||||
| 4 | 84 | 328 | 320 | 64 | 796 | ||||
| 5 | 261 | 1512 | 2752 | 1728 | 256 | 6509 | |||
| 6 | 770 | 5948 | 16256 | 18880 | 8704 | 1024 | 51582 | ||
| 7 | 2197 | 21260 | 78160 | 136512 | 115456 | 41984 | 4096 | 399665 | |
| 8 | 6120 | 71248 | 330368 | 779136 | 989184 | 655360 | 196608 | 16384 | 3044408 |
Compute more
?
Technical details
- Node id
n-1607a06f087588c8· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-e241b42e92753aa4
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: 6, 4; 3: 25, 52, 16; 4: 84, 328, 320, 64; 5: 261, 1512, 2752, 1728, 256; 6: 770, 5948, 16256, 18880, 8704, 1024; 7: 2197, 21260, 78160, 136512, 115456, 41984, 4096; 8: 6120, 71248, 330368, 779136, 989184, 655360, 196608, 16384; 9: 16745, 227984, 1278464, 3817088, 6550016, 6496256, 3530752, 901120, 65536; 10: 45182, 704564, 4639744, 16808576, 36580352, 49014784, 39763968, 18300928, 4063232, 262144;
%F FormulaThe row polynomials satisfy (4*n^2-10*n+6+(8*n^3-24*n^2+22*n-6)*x+(16*n^2-56*n+40)*x^2+(16*n^2-44*n+28)*x^3+(16*n-16)*x^4)*P(n,x) = -(8*n^3-52*n^2+80*n-28+(24*n^3-184*n^2+270*n-40)*x-(32*n^2+52*n-256)*x^2+(48*n^2-196*n+208)*x^3-(16*n+80)*x^4-64*x^5)*P(n-1,x) + (4*n^2-8*n+3+(32*n^2-56*n+14)*x+(72*n^2-72*n-24)*x^2+(32*n^2+144*n-132)*x^3+(208*n+20)*x^4+(64*n+160)*x^5+64*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[(-(8*n^3 - 52*n^2 + 80*n - 28 + (24*n^3 - 184*n^2 + 270*n - 40)*x - (32*n^2 + 52*n - 256)*x^2 + (48*n^2 - 196*n + 208)*x^3 - (16*n + 80)*x^4 - 64*x^5)*P[n - 1, x] + (4*n^2 - 8*n + 3 + (32*n^2 - 56*n + 14)*x + (72*n^2 - 72*n - 24)*x^2 + (32*n^2 + 144*n - 132)*x^3 + (208*n + 20)*x^4 + (64*n + 160)*x^5 + 64*x^6)*D[P[n - 1, x], x])/(4*n^2 - 10*n + 6 + (8*n^3 - 24*n^2 + 22*n - 6)*x + (16*n^2 - 56*n + 40)*x^2 + (16*n^2 - 44*n + 28)*x^3 + (16*n - 16)*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] = (-(8*n^3 - 52*n^2 + 80*n - 28 + (24*n^3 - 184*n^2 + 270*n - 40)*x - (32*n^2 + 52*n - 256)*x^2 + (48*n^2 - 196*n + 208)*x^3 - (16*n + 80)*x^4 - 64*x^5)*v[i - 1] + (4*n^2 - 8*n + 3 + (32*n^2 - 56*n + 14)*x + (72*n^2 - 72*n - 24)*x^2 + (32*n^2 + 144*n - 132)*x^3 + (208*n + 20)*x^4 + (64*n + 160)*x^5 + 64*x^6)*deriv(v[i - 1], x))/(4*n^2 - 10*n + 6 + (8*n^3 - 24*n^2 + 22*n - 6)*x + (16*n^2 - 56*n + 40)*x^2 + (16*n^2 - 44*n + 28)*x^3 + (16*n - 16)*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_A013611 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_A013611 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.