A229032 → x ↦ x+1 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-7\,n - 6\,n x + 8\,n x^{2} + 2\,n^{2} + 8\,n^{2} x + 2\,n^{3}\right)\,P_{n}(x) = \left(9 + 6\,x - 32\,x^{2} - 32\,x^{3} - 33\,n - 50\,n x + 16\,n x^{2} + 32\,n x^{3} + 8\,n^{2} + 40\,n^{2} x + 32\,n^{2} x^{2} + 10\,n^{3} + 8\,n^{3} x\right)\,P_{n-1}(x) + \left(-18 - 102\,x - 212\,x^{2} - 192\,x^{3} - 64\,x^{4} - 36\,n - 132\,n x - 160\,n x^{2} - 64\,n x^{3} - 12\,n^{2} - 28\,n^{2} x - 16\,n^{2} x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | Pn(1) |
|---|---|---|---|---|---|
| 0 | 1 | 1 | |||
| 1 | 2 | 2 | |||
| 2 | 11 | 4 | 15 | ||
| 3 | 36 | 16 | 52 | ||
| 4 | 133 | 104 | 16 | 253 | |
| 5 | 454 | 464 | 96 | 1014 | |
| 6 | 1551 | 2060 | 720 | 64 | 4395 |
| 7 | 5192 | 8416 | 3968 | 512 | 18088 |
Compute more
?
Technical details
- Node id
n-e2303094356f15c9· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-5d4882089ebc7eac
Observed on the stored rows ?
- Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half affine: slope 1, intercept 0)
- 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 = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 2; 2: 11, 4; 3: 36, 16; 4: 133, 104, 16; 5: 454, 464, 96; 6: 1551, 2060, 720, 64; 7: 5192, 8416, 3968, 512; 8: 17225, 33232, 20448, 4352, 256; 9: 56586, 126688, 96192, 28160, 2560;
%F FormulaThe row polynomials satisfy (2*n^3+2*n^2-7*n+(8*n^2-6*n)*x+8*n*x^2)*P(n,x) = (10*n^3+8*n^2-33*n+9+(8*n^3+40*n^2-50*n+6)*x+(32*n^2+16*n-32)*x^2+(32*n-32)*x^3)*P(n-1,x) - (12*n^2+36*n+18+(28*n^2+132*n+102)*x+(16*n^2+160*n+212)*x^2+(64*n+192)*x^3+64*x^4)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((10*n^3 + 8*n^2 - 33*n + 9 + (8*n^3 + 40*n^2 - 50*n + 6)*x + (32*n^2 + 16*n - 32)*x^2 + (32*n - 32)*x^3)*P[n - 1, x] - (12*n^2 + 36*n + 18 + (28*n^2 + 132*n + 102)*x + (16*n^2 + 160*n + 212)*x^2 + (64*n + 192)*x^3 + 64*x^4)*D[P[n - 1, x], x])/(2*n^3 + 2*n^2 - 7*n + (8*n^2 - 6*n)*x + 8*n*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((10*n^3 + 8*n^2 - 33*n + 9 + (8*n^3 + 40*n^2 - 50*n + 6)*x + (32*n^2 + 16*n - 32)*x^2 + (32*n - 32)*x^3)*v[i - 1] - (12*n^2 + 36*n + 18 + (28*n^2 + 132*n + 102)*x + (16*n^2 + 160*n + 212)*x^2 + (64*n + 192)*x^3 + 64*x^4)*deriv(v[i - 1], x))/(2*n^3 + 2*n^2 - 7*n + (8*n^2 - 6*n)*x + 8*n*x^2)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
derived from Laguerre’s theorem on differential operators
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, 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 T(n,k), 0 <= k <= n, read by rows, defined by T(n,k) = 4^k * C(n+1,2*k+1).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, defined by T(n,k) = 4^k * C(n+1,2*k+1).?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
One half of odd-numbered entries of even-numbered rows of Pascal's triangle A007318.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
One half of odd-numbered entries of even-numbered rows of Pascal's triangle A007318.?
-
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, defined by T(n,k) = 4^k * C(n+1,2*k+1).?
-
-
from
shift_x_plus_one of Triangle T(n,k), 0 <= k <= n, read by rows, defined by T(n,k) = 4^k * C(n+1,2*k+1).?
References
- [Fav35] Jean Favard. Sur les polynômes de tchebicheff. C. R. Acad. Sci. Paris, 200:2052–2053, 1935.
- [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.
- [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023