A122848 → basis A013610 → basis A007318
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(3\right)\,P_{n}(x) = \left(15 + 9\,x - 3\,n\right)\,P_{n-1}(x) + \left(8 + 6\,x\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 4 | 3 | 7 | ||||||
| 2 | 20 | 27 | 9 | 56 | |||||
| 3 | 112 | 216 | 135 | 27 | 490 | ||||
| 4 | 688 | 1704 | 1539 | 594 | 81 | 4606 | |||
| 5 | 4544 | 13680 | 16020 | 9045 | 2430 | 243 | 45962 | ||
| 6 | 31936 | 112752 | 161460 | 119205 | 47385 | 9477 | 729 | 482944 | |
| 7 | 236800 | 956928 | 1614816 | 1466640 | 768285 | 229635 | 35721 | 2187 | 5311012 |
Compute more
?
Other recurrences
Image under the basis map A007318 · proved equal for all n (proof step)
\(P_{n}(x) = \left(-4 - 3\,x + 4\,n + 3\,n x\right)\,P_{n-2}(x) + \left(4 + 3\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 4 + 3\,x\)
Technical details
- Node id
n-fe9ce24e9dac9349· revision 0 · JSON- Definition source
derived:shift_x_plus_onederived:basis_map_A007318(equal bye-f6d27d927285768f)- Fingerprint
f6-eb5b4007393f32fd
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: 4, 3; 2: 20, 27, 9; 3: 112, 216, 135, 27; 4: 688, 1704, 1539, 594, 81; 5: 4544, 13680, 16020, 9045, 2430, 243; 6: 31936, 112752, 161460, 119205, 47385, 9477, 729; 7: 236800, 956928, 1614816, 1466640, 768285, 229635, 35721, 2187; 8: 1841408, 8365824, 16218720, 17439408, 11303145, 4483836, 1051218, 131220, 6561; 9: 14943232, 75292416, 164612736, 204101856, 157315284, 77631939, 24310692, 4605822, 472392, 19683;
%F FormulaThe row polynomials satisfy 3*P(n,x) = -(3*n-15-9*x)*P(n-1,x) + (8+6*x)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[(-(3*n - 15 - 9*x)*P[n - 1, x] + (8 + 6*x)*D[P[n - 1, x], x])/(3)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = (-(3*n - 15 - 9*x)*v[i - 1] + (8 + 6*x)*deriv(v[i - 1], x))/(3)); 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 (−∞, -1]
- Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Geometric basis map (elementary) polytool ? step ›
-
from
basis_map_A013610 of Exponential Riordan array (1, x(1+x/2)).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Exponential Riordan array (1, x(1+x/2)).?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the compl…?
-
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
Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the compl…?
-
-
from
Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).?
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
-
from
Exponential Riordan array (1, x(1+x/2)).?
-
-
from
basis_map_A013610 of Exponential Riordan array (1, x(1+x/2)).?
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