A110441 → basis A007318 → basis A008277
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(-2\right)\,P_{n-2}(x) + \left(5 + x\right)\,P_{n-1}(x) + \left(x\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 5 + x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 5 | 1 | 6 | ||||||
| 2 | 23 | 11 | 1 | 35 | |||||
| 3 | 105 | 87 | 18 | 1 | 211 | ||||
| 4 | 479 | 605 | 211 | 26 | 1 | 1322 | |||
| 5 | 2185 | 3935 | 2046 | 417 | 35 | 1 | 8619 | ||
| 6 | 9967 | 24585 | 17835 | 5330 | 730 | 45 | 1 | 58493 | |
| 7 | 45465 | 149607 | 145338 | 59641 | 11830 | 1178 | 56 | 1 | 413116 |
Compute more
?
Technical details
- Node id
n-474534da83c4df65· revision 0 · JSON- Definition source
derived:basis_map_A008277- Fingerprint
f6-29275a5110dbc9b2
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 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: 5, 1; 2: 23, 11, 1; 3: 105, 87, 18, 1; 4: 479, 605, 211, 26, 1; 5: 2185, 3935, 2046, 417, 35, 1; 6: 9967, 24585, 17835, 5330, 730, 45, 1; 7: 45465, 149607, 145338, 59641, 11830, 1178, 56, 1; 8: 207391, 893937, 1131303, 611806, 164651, 23520, 1792, 68, 1; 9: 946025, 5271799, 8522382, 5906469, 2070005, 397495, 43120, 2606, 81, 1;
%F FormulaThe row polynomials satisfy P(n,x) = -2*P(n-2,x) + (5+x)*P(n-1,x) + x*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 5 + x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 5 + x;
P[n_, x_] := P[n, x] = Expand[-2*P[n - 2, x] + (5 + x)*P[n - 1, x] + x*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 5 + x; for(n = 2, N, my(i = n + 1); v[i] = -2*v[i - 2] + (5 + x)*v[i - 1] + x*deriv(v[i - 1], x)); 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 Ray basis map theorem
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Ray basis map theorem
Proof chains ? JSON
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
basis_map_A007318 of Triangular array formed by the Mersenne numbers.?
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A007318 of Triangular array formed by the Mersenne numbers.?
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
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
- [Sze39] G. Szegő. Orthogonal Polynomials. Colloquium publications, American Mathematical Society, 1939. doi:10.1090/coll/023