A121574 → basis A013610 → basis A008277
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(4 + 3\,x\right)\,P_{n-2}(x) + \left(3\,x\right)\,P_{n-2}'(x) + \left(6 + 3\,x\right)\,P_{n-1}(x) + \left(3\,x\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 6 + 3\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 6 | 3 | 9 | ||||||
| 2 | 40 | 48 | 9 | 97 | |||||
| 3 | 264 | 591 | 261 | 27 | 1143 | ||||
| 4 | 1744 | 6567 | 5139 | 1215 | 81 | 14746 | |||
| 5 | 11520 | 69264 | 85752 | 34776 | 5184 | 243 | 206739 | ||
| 6 | 76096 | 709137 | 1307907 | 810108 | 202581 | 20898 | 729 | 3127456 | |
| 7 | 502656 | 7129929 | 18887607 | 16784685 | 6264054 | 1066770 | 80919 | 2187 | 50718807 |
Compute more
?
Technical details
- Node id
n-5e638ee6cdb61b45· revision 0 · JSON- Definition source
derived:basis_map_A008277- Fingerprint
f6-d7f410eb79d1ee44
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: 6, 3; 2: 40, 48, 9; 3: 264, 591, 261, 27; 4: 1744, 6567, 5139, 1215, 81; 5: 11520, 69264, 85752, 34776, 5184, 243; 6: 76096, 709137, 1307907, 810108, 202581, 20898, 729; 7: 502656, 7129929, 18887607, 16784685, 6264054, 1066770, 80919, 2187; 8: 3320320, 70869576, 263247552, 322888221, 168778647, 42199137, 5221098, 303993, 6561; 9: 21932544, 699204615, 3581845209, 5907929697, 4157259228, 1431578610, 256884291, 24168537, 1115370, 19683;
%F FormulaThe row polynomials satisfy P(n,x) = (4+3*x)*P(n-2,x) + 3*x*d/dx P(n-2,x) + (6+3*x)*P(n-1,x) + 3*x*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 6 + 3*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 6 + 3*x;
P[n_, x_] := P[n, x] = Expand[(4 + 3*x)*P[n - 2, x] + 3*x*D[P[n - 2, x], x] + (6 + 3*x)*P[n - 1, x] + 3*x*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; v[2] = 6 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = (4 + 3*x)*v[i - 2] + 3*x*deriv(v[i - 2], x) + (6 + 3*x)*v[i - 1] + 3*x*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
derived from Ray basis map theorem
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Ray basis map theorem
Proof chains ? JSON
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
basis_map_A013610 of Riordan array (1/(1-2*x), x*(1+x)/(1-2*x)).?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Riordan array (1/(1-2*x), x*(1+x)/(1-2*x)).?
-
Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ? step › direct check
-
-
from
Riordan array (1/(1-2*x), x*(1+x)/(1-2*x)).?
-
-
from
basis_map_A013610 of Riordan array (1/(1-2*x), x*(1+x)/(1-2*x)).?
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
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741