A098158 → basis A013609
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(-2\,x - 4\,x^{2}\right)\,P_{n-2}(x) + \left(2 + 4\,x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 1 + 2\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | |||||||
| 2 | 1 | 2 | 3 | ||||||
| 3 | 2 | 6 | 4 | 12 | |||||
| 4 | 4 | 18 | 24 | 8 | 54 | ||||
| 5 | 8 | 48 | 100 | 80 | 16 | 252 | |||
| 6 | 16 | 120 | 340 | 440 | 240 | 32 | 1188 | ||
| 7 | 32 | 288 | 1032 | 1848 | 1680 | 672 | 64 | 5616 | |
| 8 | 64 | 672 | 2912 | 6664 | 8512 | 5824 | 1792 | 128 | 26568 |
Compute more
?
Technical details
- Node id
n-5ee028b5ac74ee9f· revision 0 · JSON- Definition source
derived:basis_map_A013609- Fingerprint
f6-d28547f04e8d9834
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 -1)
- 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 = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 1; 2: 1, 2; 3: 2, 6, 4; 4: 4, 18, 24, 8; 5: 8, 48, 100, 80, 16; 6: 16, 120, 340, 440, 240, 32; 7: 32, 288, 1032, 1848, 1680, 672, 64; 8: 64, 672, 2912, 6664, 8512, 5824, 1792, 128; 9: 128, 1536, 7808, 21760, 35856, 34944, 18816, 4608, 256; 10: 256, 3456, 20160, 66240, 133776, 169632, 131712, 57600, 11520, 512;
%F FormulaThe row polynomials satisfy P(n,x) = -(2*x+4*x^2)*P(n-2,x) + (2+4*x)*P(n-1,x) for n >= 3, with P(1,x) = 1, P(2,x) = 1 + 2*x.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 1 + 2*x;
P[n_, x_] := P[n, x] = Expand[-(2*x + 4*x^2)*P[n - 2, x] + (2 + 4*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 1 + 2*x; for(n = 3, N, my(i = n); v[i] = -(2*x + 4*x^2)*v[i - 2] + (2 + 4*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, v[i])))};
T(10)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
derived from Geometric basis map (elementary)
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
derived from Geometric basis map (elementary)
Proof chains ? JSON
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