A056242 → x ↦ x+1 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-10 - 10\,x + 4\,x^{2} + 4\,x^{3} + 15\,n + 18\,n x - 4\,n x^{3} - 6\,n^{2} - 8\,n^{2} x - 4\,n^{2} x^{2} + n^{3}\right)\,P_{n}(x) = \left(-10 - 22\,x - 24\,x^{2} - 20\,x^{3} - 8\,x^{4} + 7\,n + 4\,n x - 16\,n x^{2} - 12\,n x^{3} + 2\,n^{2} - 2\,n^{2} x - 4\,n^{2} x^{2} + n^{3}\right)\,P_{n-1}(x) + \left(-24 - 92\,x - 144\,x^{2} - 116\,x^{3} - 48\,x^{4} - 8\,x^{5} - 20\,n - 62\,n x - 74\,n x^{2} - 40\,n x^{3} - 8\,n x^{4} + 4\,n^{2} + 6\,n^{2} x + 2\,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 | 5 | 2 | 7 | ||||||
| 3 | 23 | 21 | 4 | 48 | |||||
| 4 | 99 | 145 | 64 | 8 | 316 | ||||
| 5 | 408 | 830 | 593 | 172 | 16 | 2019 | |||
| 6 | 1632 | 4266 | 4257 | 2002 | 432 | 32 | 12621 | ||
| 7 | 6388 | 20440 | 26305 | 17305 | 6056 | 1040 | 64 | 77598 | |
| 8 | 24596 | 93208 | 147209 | 125057 | 61248 | 17056 | 2432 | 128 | 470934 |
Compute more
?
Technical details
- Node id
n-50e7e81aaf481dd2· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-4741a0ab4b883c71
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, 2; 3: 23, 21, 4; 4: 99, 145, 64, 8; 5: 408, 830, 593, 172, 16; 6: 1632, 4266, 4257, 2002, 432, 32; 7: 6388, 20440, 26305, 17305, 6056, 1040, 64; 8: 24596, 93208, 147209, 125057, 61248, 17056, 2432, 128; 9: 93488, 409680, 767728, 801260, 507009, 197608, 45680, 5568, 256; 10: 351664, 1750160, 3797984, 4707476, 3661293, 1843986, 596560, 117856, 12544, 512;
%F FormulaThe row polynomials satisfy (n^3-6*n^2+15*n-10-(8*n^2-18*n+10)*x-(4*n^2-4)*x^2-(4*n-4)*x^3)*P(n,x) = (n^3+2*n^2+7*n-10-(2*n^2-4*n+22)*x-(4*n^2+16*n+24)*x^2-(12*n+20)*x^3-8*x^4)*P(n-1,x) + (4*n^2-20*n-24+(6*n^2-62*n-92)*x+(2*n^2-74*n-144)*x^2-(40*n+116)*x^3-(8*n+48)*x^4-8*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[((n^3 + 2*n^2 + 7*n - 10 - (2*n^2 - 4*n + 22)*x - (4*n^2 + 16*n + 24)*x^2 - (12*n + 20)*x^3 - 8*x^4)*P[n - 1, x] + (4*n^2 - 20*n - 24 + (6*n^2 - 62*n - 92)*x + (2*n^2 - 74*n - 144)*x^2 - (40*n + 116)*x^3 - (8*n + 48)*x^4 - 8*x^5)*D[P[n - 1, x], x])/(n^3 - 6*n^2 + 15*n - 10 - (8*n^2 - 18*n + 10)*x - (4*n^2 - 4)*x^2 - (4*n - 4)*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] = ((n^3 + 2*n^2 + 7*n - 10 - (2*n^2 - 4*n + 22)*x - (4*n^2 + 16*n + 24)*x^2 - (12*n + 20)*x^3 - 8*x^4)*v[i - 1] + (4*n^2 - 20*n - 24 + (6*n^2 - 62*n - 92)*x + (2*n^2 - 74*n - 144)*x^2 - (40*n + 116)*x^3 - (8*n + 48)*x^4 - 8*x^5)*deriv(v[i - 1], x))/(n^3 - 6*n^2 + 15*n - 10 - (8*n^2 - 18*n + 10)*x - (4*n^2 - 4)*x^2 - (4*n - 4)*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
shift_x_plus_one of Triangle read by rows: T(n,k) = number of k-part order-consecutive partition of {1,2,...,n} (1 <= k…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = number of k-part order-consecutive partition of {1,2,...,n} (1 <= k <= n).?
-
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, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
Triangle read by rows: T(n,k) = number of k-part order-consecutive partition of {1,2,...,n} (1 <= k <= n).?
-
-
from
shift_x_plus_one of Triangle read by rows: T(n,k) = number of k-part order-consecutive partition of {1,2,...,n} (1 <= k…?
References
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.