A143685 → basis A007318 → x ↦ x+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernel
Recurrence
\(\left(n\right)\,P_{n}(x) = \left(23 + 2\,x - 30\,n - n x + 10\,n^{2}\right)\,P_{n-1}(x) + \left(207 + 111\,x + 4\,x^{2} - 81\,n - 42\,n x - n x^{2}\right)\,P_{n-1}'(x) + \left(162 + 165\,x + 44\,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 | 3 | 1 | 4 | ||||||
| 2 | 27 | 15 | 1 | 43 | |||||
| 3 | 135 | 117 | 27 | 1 | 280 | ||||
| 4 | 891 | 999 | 351 | 39 | 1 | 2281 | |||
| 5 | 5103 | 7209 | 3591 | 729 | 51 | 1 | 16684 | ||
| 6 | 31347 | 52731 | 33291 | 9639 | 1251 | 63 | 1 | 128323 | |
| 7 | 185895 | 365229 | 282123 | 107649 | 20871 | 1917 | 75 | 1 | 963760 |
Compute more
?
Technical details
- Node id
n-549939118a9956ba· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-9534464459a0c5cc
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: 3, 1; 2: 27, 15, 1; 3: 135, 117, 27, 1; 4: 891, 999, 351, 39, 1; 5: 5103, 7209, 3591, 729, 51, 1; 6: 31347, 52731, 33291, 9639, 1251, 63, 1; 7: 185895, 365229, 282123, 107649, 20871, 1917, 75, 1; 8: 1121931, 2512863, 2285415, 1078191, 279531, 39015, 2727, 87, 1; 9: 6711903, 16907697, 17734383, 9996777, 3261303, 618921, 65799, 3681, 99, 1;
%F FormulaThe row polynomials satisfy n*P(n,x) = (10*n^2-30*n+23-(n-2)*x)*P(n-1,x) - (81*n-207+(42*n-111)*x+(n-4)*x^2)*d/dx P(n-1,x) + (162+165*x+44*x^2+x^3)*d^2/dx^2 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[((10*n^2 - 30*n + 23 - (n - 2)*x)*P[n - 1, x] - (81*n - 207 + (42*n - 111)*x + (n - 4)*x^2)*D[P[n - 1, x], x] + (162 + 165*x + 44*x^2 + x^3)*D[P[n - 1, x], {x, 2}])/(n)]];
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] = ((10*n^2 - 30*n + 23 - (n - 2)*x)*v[i - 1] - (81*n - 207 + (42*n - 111)*x + (n - 4)*x^2)*deriv(v[i - 1], x) + (162 + 165*x + 44*x^2 + x^3)*deriv(deriv(v[i - 1], x), x))/(n)); 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)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A007318 of Pascal-(1,9,1) array.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Pascal-(1,9,1) array.?
-
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
Pascal-(1,9,1) array.?
-
-
from
basis_map_A007318 of Pascal-(1,9,1) array.?
Related ?
Candidate equalities ?
- A143685 → basis A007318 → basis A007318 15 rows; no all-index equality certificate was found
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