A129718 → basis A013610
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-2 + n\right)\,P_{n}(x) = \left(-2 - 6\,x + n + 3\,n x\right)\,P_{n-2}(x) + \left(-2 + n\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 2 + 3\,x\)
\(P_{2}(x) = 3 + 9\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 2 | 3 | 5 | ||||||
| 2 | 3 | 9 | 12 | ||||||
| 3 | 5 | 18 | 9 | 32 | |||||
| 4 | 8 | 36 | 36 | 80 | |||||
| 5 | 13 | 69 | 99 | 27 | 208 | ||||
| 6 | 21 | 129 | 243 | 135 | 528 | ||||
| 7 | 34 | 237 | 549 | 459 | 81 | 1360 | |||
| 8 | 55 | 429 | 1179 | 1323 | 486 | 3472 | |||
| 9 | 89 | 768 | 2439 | 3429 | 1944 | 243 | 8912 | ||
| 10 | 144 | 1362 | 4905 | 8289 | 6399 | 1701 | 22800 | ||
| 11 | 233 | 2397 | 9648 | 19035 | 18630 | 7776 | 729 | 58448 | |
| 12 | 377 | 4191 | 18639 | 42039 | 49896 | 28674 | 5832 | 149648 | |
| 13 | 610 | 7287 | 35478 | 90018 | 125631 | 92340 | 29889 | 2187 | 383440 |
| 14 | 987 | 12609 | 66690 | 187974 | 301644 | 270702 | 121743 | 19683 | 982032 |
Compute more
?
Technical details
- Node id
n-ef64ba43ed5fa494· revision 0 · JSON- Definition source
derived:basis_map_A013610- Fingerprint
f6-81a3eff1e217965b
Observed on the stored rows ?
- Degrees: 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7 (half 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 = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 2, 3; 2: 3, 9; 3: 5, 18, 9; 4: 8, 36, 36; 5: 13, 69, 99, 27; 6: 21, 129, 243, 135; 7: 34, 237, 549, 459, 81; 8: 55, 429, 1179, 1323, 486; 9: 89, 768, 2439, 3429, 1944, 243;
%F FormulaThe row polynomials satisfy (n-2)*P(n,x) = (n-2+(3*n-6)*x)*P(n-2,x) + (n-2)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 2 + 3*x, P(2,x) = 3 + 9*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 2 + 3*x;
P[2, x_] := 3 + 9*x;
P[n_, x_] := P[n, x] = Expand[Together[((n - 2 + (3*n - 6)*x)*P[n - 2, x] + (n - 2)*P[n - 1, x])/(n - 2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2 + 3*x; v[3] = 3 + 9*x; for(n = 3, N, my(i = n + 1); v[i] = ((n - 2 + (3*n - 6)*x)*v[i - 2] + (n - 2)*v[i - 1])/(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 Geometric basis map (elementary)
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Geometric basis map (elementary)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 2
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