A113413 → x ↦ x+1 → basis A013610
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(2 + 3\,x\right)\,P_{n-2}(x) + \left(3 + 3\,x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 4 + 3\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 4 | 3 | 7 | ||||||
| 2 | 14 | 24 | 9 | 47 | |||||
| 3 | 50 | 132 | 108 | 27 | 317 | ||||
| 4 | 178 | 636 | 810 | 432 | 81 | 2137 | |||
| 5 | 634 | 2856 | 4950 | 4104 | 1620 | 243 | 14407 | ||
| 6 | 2258 | 12276 | 26946 | 30456 | 18630 | 5832 | 729 | 97127 | |
| 7 | 8042 | 51216 | 136134 | 195264 | 162810 | 78732 | 20412 | 2187 | 654797 |
Compute more
?
Technical details
- Node id
n-201fbbf05bd763ad· revision 0 · JSON- Definition source
derived:basis_map_A013610- Fingerprint
f6-b3f6ce63936ad778
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: 14, 24, 9; 3: 50, 132, 108, 27; 4: 178, 636, 810, 432, 81; 5: 634, 2856, 4950, 4104, 1620, 243; 6: 2258, 12276, 26946, 30456, 18630, 5832, 729; 7: 8042, 51216, 136134, 195264, 162810, 78732, 20412, 2187; 8: 28642, 209100, 652770, 1135944, 1202850, 792180, 316386, 69984, 6561; 9: 102010, 839784, 3011526, 6165072, 7927794, 6630984, 3602718, 1224720, 236196, 19683;
%F FormulaThe row polynomials satisfy P(n,x) = (2+3*x)*P(n-2,x) + (3+3*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 4 + 3*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 4 + 3*x;
P[n_, x_] := P[n, x] = Expand[(2 + 3*x)*P[n - 2, x] + (3 + 3*x)*P[n - 1, 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] = 4 + 3*x; for(n = 2, N, my(i = n + 1); v[i] = (2 + 3*x)*v[i - 2] + (3 + 3*x)*v[i - 1]); 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 Geometric basis map (elementary)
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Geometric basis map (elementary)
- 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_A007318 of A Riordan array of coordination sequences.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
A Riordan array of coordination sequences.?
-
Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ? step › direct check
-
from
A Riordan array of coordination sequences.?
-
-
from
basis_map_A007318 of A Riordan array of coordination sequences.?
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