A081579 → γ → basis A008277
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(4 + 4\,x\right)\,P_{n-2}(x) + \left(4\,x\right)\,P_{n-2}'(x) + \left(1\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 1 | 1 | |||||||
| 2 | 5 | 4 | 9 | ||||||
| 3 | 9 | 8 | 17 | ||||||
| 4 | 29 | 60 | 16 | 105 | |||||
| 5 | 65 | 160 | 48 | 273 | |||||
| 6 | 181 | 756 | 480 | 64 | 1481 | ||||
| 7 | 441 | 2296 | 1696 | 256 | 4689 | ||||
| 8 | 1165 | 9068 | 10480 | 3200 | 256 | 24169 | |||
| 9 | 2929 | 29200 | 40016 | 14080 | 1280 | 87505 | |||
| 10 | 7589 | 106404 | 202048 | 107200 | 19200 | 1024 | 443465 | ||
| 11 | 19305 | 351720 | 799040 | 492544 | 101120 | 6144 | 1769873 | ||
| 12 | 49661 | 1233308 | 3649232 | 3015936 | 913920 | 107520 | 4096 | 8973673 | |
| 13 | 126881 | 4124288 | 14644592 | 14092800 | 4906496 | 659456 | 28672 | 38583185 | |
| 14 | 325525 | 14189396 | 63368608 | 76944704 | 35248640 | 6895616 | 573440 | 16384 | 197562313 |
Compute more
?
Technical details
- Node id
n-59daee5032c230a2· revision 0 · JSON- Definition source
derived:basis_map_A008277- Fingerprint
f6-67d94b8ccefb5bbe
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: 1; 2: 5, 4; 3: 9, 8; 4: 29, 60, 16; 5: 65, 160, 48; 6: 181, 756, 480, 64; 7: 441, 2296, 1696, 256; 8: 1165, 9068, 10480, 3200, 256; 9: 2929, 29200, 40016, 14080, 1280;
%F FormulaThe row polynomials satisfy P(n,x) = (4+4*x)*P(n-2,x) + 4*x*d/dx P(n-2,x) + P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(4 + 4*x)*P[n - 2, x] + 4*x*D[P[n - 2, x], x] + P[n - 1, 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] = 1; for(n = 2, N, my(i = n + 1); v[i] = (4 + 4*x)*v[i - 2] + 4*x*deriv(v[i - 2], x) + v[i - 1]); 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
gamma_polynomial of Pascal-(1,4,1) array.?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
Pascal-(1,4,1) array.?
-
Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
Pascal-(1,4,1) array.?
-
-
from
gamma_polynomial of Pascal-(1,4,1) array.?
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