A122848 → basis A013609 → reverse
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(2 - x^{2} + n x + n x^{2}\right)\,P_{n-1}(x) + \left(-2\,x^{2} - x^{3}\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 | 2 | 1 | 3 | ||||||
| 2 | 4 | 6 | 2 | 12 | |||||
| 3 | 8 | 24 | 18 | 4 | 54 | ||||
| 4 | 16 | 80 | 108 | 56 | 10 | 270 | |||
| 5 | 32 | 240 | 520 | 460 | 180 | 26 | 1458 | ||
| 6 | 64 | 672 | 2160 | 2920 | 1920 | 612 | 76 | 8424 | |
| 7 | 128 | 1792 | 8064 | 15680 | 15400 | 8064 | 2156 | 232 | 51516 |
Compute more
?
Technical details
- Node id
n-997d0b42ad183d9c· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-d941c5a22e857f2d
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: 2, 1; 2: 4, 6, 2; 3: 8, 24, 18, 4; 4: 16, 80, 108, 56, 10; 5: 32, 240, 520, 460, 180, 26; 6: 64, 672, 2160, 2920, 1920, 612, 76; 7: 128, 1792, 8064, 15680, 15400, 8064, 2156, 232; 8: 256, 4608, 27776, 74368, 102480, 78848, 34384, 7968, 764; 9: 512, 11520, 89856, 319872, 594720, 632016, 399840, 149328, 30456, 2620;
%F FormulaThe row polynomials satisfy P(n,x) = (2+n*x+(n-1)*x^2)*P(n-1,x) - (2*x^2+x^3)*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[(2 + n*x + (n - 1)*x^2)*P[n - 1, x] - (2*x^2 + x^3)*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; for(n = 1, N, my(i = n + 1); v[i] = (2 + n*x + (n - 1)*x^2)*v[i - 1] - (2*x^2 + x^3)*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
- Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A013609 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_A013609 of Exponential Riordan array (1, x(1+x/2)).?
Related ?
Same fingerprint ?
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