A049403 → reverse
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(1 + 2\,x + n x\right)\,P_{n-1}(x) + \left(-2\,x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1 + 3\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 3 | 4 | |||||||
| 1 | 1 | 6 | 3 | 10 | ||||||
| 2 | 1 | 10 | 15 | 26 | ||||||
| 3 | 1 | 15 | 45 | 15 | 76 | |||||
| 4 | 1 | 21 | 105 | 105 | 232 | |||||
| 5 | 1 | 28 | 210 | 420 | 105 | 764 | ||||
| 6 | 1 | 36 | 378 | 1260 | 945 | 2620 | ||||
| 7 | 1 | 45 | 630 | 3150 | 4725 | 945 | 9496 | |||
| 8 | 1 | 55 | 990 | 6930 | 17325 | 10395 | 35696 | |||
| 9 | 1 | 66 | 1485 | 13860 | 51975 | 62370 | 10395 | 140152 | ||
| 10 | 1 | 78 | 2145 | 25740 | 135135 | 270270 | 135135 | 568504 | ||
| 11 | 1 | 91 | 3003 | 45045 | 315315 | 945945 | 945945 | 135135 | 2390480 | |
| 12 | 1 | 105 | 4095 | 75075 | 675675 | 2837835 | 4729725 | 2027025 | 10349536 | |
| 13 | 1 | 120 | 5460 | 120120 | 1351350 | 7567560 | 18918900 | 16216200 | 2027025 | 46206736 |
| 14 | 1 | 136 | 7140 | 185640 | 2552550 | 18378360 | 64324260 | 91891800 | 34459425 | 211799312 |
Compute more
?
Technical details
- Node id
n-6844deeae511b843· revision 0 · JSON- Definition source
derived:reversal- Fingerprint
f6-eccca8d515312e3b
Observed on the stored rows ?
- Degrees: 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8 (half affine: slope 1, intercept 3)
- 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, 3; 1: 1, 6, 3; 2: 1, 10, 15; 3: 1, 15, 45, 15; 4: 1, 21, 105, 105; 5: 1, 28, 210, 420, 105; 6: 1, 36, 378, 1260, 945; 7: 1, 45, 630, 3150, 4725, 945; 8: 1, 55, 990, 6930, 17325, 10395; 9: 1, 66, 1485, 13860, 51975, 62370, 10395;
%F FormulaThe row polynomials satisfy P(n,x) = (1+(n+2)*x)*P(n-1,x) - 2*x^2*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1 + 3*x.
%t MathematicaP[0, x_] := 1 + 3*x;
P[n_, x_] := P[n, x] = Expand[(1 + (n + 2)*x)*P[n - 1, x] - 2*x^2*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 + 3*x; for(n = 1, N, my(i = n + 1); v[i] = (1 + (n + 2)*x)*v[i - 1] - 2*x^2*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
Related ?
Same fingerprint ?
- A triangle of numbers related to triangle A030528; array a(n,m), read by rows (1 <= m <= n).
- A100861: Triangle of Bessel numbers read by rows: T(n,k) is the number of k-matchings of the complete graph K(n).
- A122848: Exponential Riordan array (1, x(1+x/2)).
- A100861 → D → D
- A100861 → D
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