A008288 → basis A007318 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(4\,x^{2} - 5\,x^{3} - x^{4} - 4\,n - 2\,n x - 11\,n x^{2} + 4\,n x^{3} + n x^{4} + 4\,n^{2} + 7\,n^{2} x^{2} + n^{2} x^{3} + 2\,n^{3} x\right)\,P_{n}(x) = \left(-32 - 56\,x + 20\,x^{2} + 53\,x^{3} + 14\,x^{4} + x^{5} + 4\,n + 66\,n x + 49\,n x^{2} - 5\,n x^{3} - 2\,n x^{4} + 28\,n^{2} + 4\,n^{2} x - 19\,n^{2} x^{2} - 3\,n^{2} x^{3} - 8\,n^{3} - 6\,n^{3} x\right)\,P_{n-1}(x) + \left(32\,x + 120\,x^{2} + 156\,x^{3} + 83\,x^{4} + 16\,x^{5} + x^{6} + 16\,n + 88\,n x + 138\,n x^{2} + 81\,n x^{3} + 16\,n x^{4} + n x^{5} + 16\,n^{2} + 32\,n^{2} x + 18\,n^{2} x^{2} + 2\,n^{2} x^{3}\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | ||||||||||||||
| 2 | 3 | 1 | 4 | |||||||||||||
| 3 | 10 | 7 | 1 | 18 | ||||||||||||
| 4 | 30 | 34 | 11 | 1 | 76 | |||||||||||
| 5 | 87 | 138 | 73 | 15 | 1 | 314 | ||||||||||
| 6 | 245 | 503 | 377 | 127 | 19 | 1 | 1272 | |||||||||
| 7 | 676 | 1709 | 1672 | 801 | 196 | 23 | 1 | 5078 | ||||||||
| 8 | 1836 | 5524 | 6698 | 4206 | 1464 | 280 | 27 | 1 | 20036 | |||||||
| 9 | 4925 | 17204 | 24950 | 19490 | 8906 | 2420 | 379 | 31 | 1 | 78306 | ||||||
| 10 | 13079 | 52061 | 88006 | 82490 | 46982 | 16762 | 3723 | 493 | 35 | 1 | 303632 | |||||
| 11 | 34446 | 153971 | 297539 | 325974 | 223208 | 99338 | 28953 | 5427 | 622 | 39 | 1 | 1169518 | ||||
| 12 | 90090 | 446934 | 972429 | 1220727 | 978792 | 524280 | 190637 | 46847 | 7586 | 766 | 43 | 1 | 4479132 | |||
| 13 | 234227 | 1277310 | 3091287 | 4378057 | 4029003 | 2529996 | 1107765 | 339521 | 72001 | 10254 | 925 | 47 | 1 | 17070394 | ||
| 14 | 605865 | 3602867 | 9602871 | 15153921 | 15756937 | 11369355 | 5839941 | 2155563 | 569843 | 106161 | 13485 | 1099 | 51 | 1 | 64777960 | |
| 15 | 1560200 | 10048985 | 29254370 | 50919055 | 59073100 | 48212185 | 28477300 | 12335125 | 3926560 | 911315 | 151262 | 17333 | 1288 | 55 | 1 | 244888134 |
Compute more
?
Technical details
- Node id
n-9fed93b7289c027d· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-8df4cfbffdd1234a
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: 3, 1; 3: 10, 7, 1; 4: 30, 34, 11, 1; 5: 87, 138, 73, 15, 1; 6: 245, 503, 377, 127, 19, 1; 7: 676, 1709, 1672, 801, 196, 23, 1; 8: 1836, 5524, 6698, 4206, 1464, 280, 27, 1; 9: 4925, 17204, 24950, 19490, 8906, 2420, 379, 31, 1; 10: 13079, 52061, 88006, 82490, 46982, 16762, 3723, 493, 35, 1;
%F FormulaThe row polynomials satisfy (4*n^2-4*n+(2*n^3-2*n)*x+(7*n^2-11*n+4)*x^2+(n^2+4*n-5)*x^3+(n-1)*x^4)*P(n,x) = -(8*n^3-28*n^2-4*n+32+(6*n^3-4*n^2-66*n+56)*x+(19*n^2-49*n-20)*x^2+(3*n^2+5*n-53)*x^3+(2*n-14)*x^4-x^5)*P(n-1,x) + (16*n^2+16*n+(32*n^2+88*n+32)*x+(18*n^2+138*n+120)*x^2+(2*n^2+81*n+156)*x^3+(16*n+83)*x^4+(n+16)*x^5+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 - 28*n^2 - 4*n + 32 + (6*n^3 - 4*n^2 - 66*n + 56)*x + (19*n^2 - 49*n - 20)*x^2 + (3*n^2 + 5*n - 53)*x^3 + (2*n - 14)*x^4 - x^5)*P[n - 1, x] + (16*n^2 + 16*n + (32*n^2 + 88*n + 32)*x + (18*n^2 + 138*n + 120)*x^2 + (2*n^2 + 81*n + 156)*x^3 + (16*n + 83)*x^4 + (n + 16)*x^5 + x^6)*D[P[n - 1, x], x])/(4*n^2 - 4*n + (2*n^3 - 2*n)*x + (7*n^2 - 11*n + 4)*x^2 + (n^2 + 4*n - 5)*x^3 + (n - 1)*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 - 28*n^2 - 4*n + 32 + (6*n^3 - 4*n^2 - 66*n + 56)*x + (19*n^2 - 49*n - 20)*x^2 + (3*n^2 + 5*n - 53)*x^3 + (2*n - 14)*x^4 - x^5)*v[i - 1] + (16*n^2 + 16*n + (32*n^2 + 88*n + 32)*x + (18*n^2 + 138*n + 120)*x^2 + (2*n^2 + 81*n + 156)*x^3 + (16*n + 83)*x^4 + (n + 16)*x^5 + x^6)*deriv(v[i - 1], x))/(4*n^2 - 4*n + (2*n^3 - 2*n)*x + (7*n^2 - 11*n + 4)*x^2 + (n^2 + 4*n - 5)*x^3 + (n - 1)*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
shift_x_plus_one of 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 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 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.?
-
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.?
-
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
shift_x_plus_one 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.