A330381 → basis A008277
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(-3 - 4\,x - x^{2}\right)\,P_{n-2}(x) + \left(-4\,x - 2\,x^{2}\right)\,P_{n-2}'(x) + \left(-x^{2}\right)\,P_{n-2}''(x) + \left(4 + 2\,x\right)\,P_{n-1}(x) + \left(2\,x\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 3 + 2\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 3 | 2 | 5 | ||||||
| 2 | 9 | 14 | 3 | 26 | |||||
| 3 | 27 | 76 | 37 | 4 | 144 | ||||
| 4 | 81 | 376 | 316 | 76 | 5 | 854 | |||
| 5 | 243 | 1778 | 2316 | 936 | 135 | 6 | 5414 | ||
| 6 | 729 | 8198 | 15639 | 9492 | 2261 | 218 | 7 | 36544 | |
| 7 | 2187 | 37228 | 100489 | 86236 | 30255 | 4760 | 329 | 8 | 261492 |
Compute more
?
Technical details
- Node id
n-fb52313e0f83daf2· revision 0 · JSON- Definition source
derived:basis_map_A008277- Fingerprint
f6-d7a1d544fb3e3e25
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: 3, 2; 2: 9, 14, 3; 3: 27, 76, 37, 4; 4: 81, 376, 316, 76, 5; 5: 243, 1778, 2316, 936, 135, 6; 6: 729, 8198, 15639, 9492, 2261, 218, 7; 7: 2187, 37228, 100489, 86236, 30255, 4760, 329, 8; 8: 6561, 167440, 625144, 730696, 354882, 81152, 9072, 472, 9; 9: 19683, 748418, 3804120, 5905152, 3819222, 1191916, 191808, 16032, 651, 10;
%F FormulaThe row polynomials satisfy P(n,x) = -(3+4*x+x^2)*P(n-2,x) - (4*x+2*x^2)*d/dx P(n-2,x) - x^2*d^2/dx^2 P(n-2,x) + (4+2*x)*P(n-1,x) + 2*x*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 2*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 3 + 2*x;
P[n_, x_] := P[n, x] = Expand[-(3 + 4*x + x^2)*P[n - 2, x] - (4*x + 2*x^2)*D[P[n - 2, x], x] - x^2*D[P[n - 2, x], {x, 2}] + (4 + 2*x)*P[n - 1, x] + 2*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] = 3 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = -(3 + 4*x + x^2)*v[i - 2] - (4*x + 2*x^2)*deriv(v[i - 2], x) - x^2*deriv(deriv(v[i - 2], x), x) + (4 + 2*x)*v[i - 1] + 2*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
Triangle read by rows: T(n,k) is the number of ternary strings of length n with k indispensable digits, with 0 <= k <= …?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) is the number of ternary strings of length n with k indispensable digits, with 0 <= k <= …?
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
- [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