A229032 → x ↦ x+1 → D
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-2 + n\right)\,P_{n}(x) = \left(-11 - 12\,x + 5\,n + 4\,n x\right)\,P_{n-1}(x) + \left(-6 - 14\,x - 8\,x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 0\)
\(P_{2}(x) = 4\)
Rows ?
| n | x0 | x1 | x2 | Pn(1) |
|---|---|---|---|---|
| 0 | 0 | |||
| 1 | 0 | |||
| 2 | 4 | 4 | ||
| 3 | 16 | 16 | ||
| 4 | 72 | 32 | 104 | |
| 5 | 272 | 192 | 464 | |
| 6 | 1004 | 1056 | 192 | 2252 |
| 7 | 3552 | 4864 | 1536 | 9952 |
Compute more
?
Technical details
- Node id
n-652b31080f32c290· revision 0 · JSON- Definition source
derived:derivative- Fingerprint
f6-1691c845c56c56f2
Observed on the stored rows ?
- Degrees: -1, -1, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6 (half affine: slope 1, intercept -2)
- 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: 0; 1: 0; 2: 4; 3: 16; 4: 72, 32; 5: 272, 192; 6: 1004, 1056, 192; 7: 3552, 4864, 1536; 8: 12304, 20928, 9984, 1024; 9: 41824, 84864, 53760, 10240;
%F FormulaThe row polynomials satisfy (n-2)*P(n,x) = (5*n-11+(4*n-12)*x)*P(n-1,x) - (6+14*x+8*x^2)*d/dx P(n-1,x) for n >= 3, with P(0,x) = 0, P(1,x) = 0, P(2,x) = 4.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 0;
P[2, x_] := 4;
P[n_, x_] := P[n, x] = Expand[Together[((5*n - 11 + (4*n - 12)*x)*P[n - 1, x] - (6 + 14*x + 8*x^2)*D[P[n - 1, x], x])/(n - 2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 0; v[3] = 4; for(n = 3, N, my(i = n + 1); v[i] = ((5*n - 11 + (4*n - 12)*x)*v[i - 1] - (6 + 14*x + 8*x^2)*deriv(v[i - 1], x))/(n - 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