A155112: Triangle T(n,k), 0<=k<=n, read by rows given by [0,2,-1/2,-1/2,0,0,0,0,0,0,0,0,...] DELTA [1,0,0,0,0,0,0,0,0,...] where DELTA is the operator defined in A084938.
A155112 ↗ nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence from A155112
\(\left(-2 + n\right)\,P_{n}(x) = \left(-2 - 2\,x + n + n x\right)\,P_{n-1}(x) + \left(-2 - 2\,x + n + n x\right)\,P_{n-2}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = x\)
\(P_{2}(x) = 2\,x + x^{2}\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 0 | 1 | 1 | |||||||||||||
| 2 | 0 | 2 | 1 | 3 | ||||||||||||
| 3 | 0 | 3 | 4 | 1 | 8 | |||||||||||
| 4 | 0 | 5 | 10 | 6 | 1 | 22 | ||||||||||
| 5 | 0 | 8 | 22 | 21 | 8 | 1 | 60 | |||||||||
| 6 | 0 | 13 | 45 | 59 | 36 | 10 | 1 | 164 | ||||||||
| 7 | 0 | 21 | 88 | 147 | 124 | 55 | 12 | 1 | 448 | |||||||
| 8 | 0 | 34 | 167 | 339 | 366 | 225 | 78 | 14 | 1 | 1224 | ||||||
| 9 | 0 | 55 | 310 | 741 | 976 | 770 | 370 | 105 | 16 | 1 | 3344 | |||||
| 10 | 0 | 89 | 566 | 1557 | 2422 | 2337 | 1443 | 567 | 136 | 18 | 1 | 9136 | ||||
| 11 | 0 | 144 | 1020 | 3174 | 5696 | 6505 | 4920 | 2485 | 824 | 171 | 20 | 1 | 24960 | |||
| 12 | 0 | 233 | 1819 | 6317 | 12849 | 16960 | 15205 | 9415 | 4012 | 1149 | 210 | 22 | 1 | 68192 | ||
| 13 | 0 | 377 | 3216 | 12330 | 28036 | 42010 | 43590 | 32025 | 16736 | 6156 | 1550 | 253 | 24 | 1 | 186304 | |
| 14 | 0 | 610 | 5645 | 23682 | 59532 | 99855 | 117765 | 100235 | 62188 | 28053 | 9065 | 2035 | 300 | 26 | 1 | 508992 |
b-files: A028859 (row sums), A154929, A155020 (row sums), A155112 ?
Compute more
?
Technical details
- Node id
n-ff76d530e3f3a037· revision 0 · JSON- Definition source
oeis_catalog:A155112- Fingerprint
f6-1d84b6f5e9f3dbf6
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 ?
- A154929 triangle 62 terms, 10 rows · tabl · nonn · catalog b-file?
- A155112 triangle 78 terms, 12 rows · tabl · nonn · catalog b-file?
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 0, 1; 2: 0, 2, 1; 3: 0, 3, 4, 1; 4: 0, 5, 10, 6, 1; 5: 0, 8, 22, 21, 8, 1; 6: 0, 13, 45, 59, 36, 10, 1; 7: 0, 21, 88, 147, 124, 55, 12, 1; 8: 0, 34, 167, 339, 366, 225, 78, 14, 1; 9: 0, 55, 310, 741, 976, 770, 370, 105, 16, 1;
%F FormulaThe row polynomials satisfy (n-2)*P(n,x) = (n-2+(n-2)*x)*P(n-1,x) + (n-2+(n-2)*x)*P(n-2,x) for n >= 3, with P(0,x) = 1, P(1,x) = x, P(2,x) = 2*x + x^2.
%t MathematicaP[0, x_] := 1;
P[1, x_] := x;
P[2, x_] := 2*x + x^2;
P[n_, x_] := P[n, x] = Expand[Together[((n - 2 + (n - 2)*x)*P[n - 1, x] + (n - 2 + (n - 2)*x)*P[n - 2, x])/(n - 2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = x; v[3] = 2*x + x^2; for(n = 3, N, my(i = n + 1); v[i] = ((n - 2 + (n - 2)*x)*v[i - 1] + (n - 2 + (n - 2)*x)*v[i - 2])/(n - 2)); 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
A154929 triangle, offset 0, from P1, low zeros dropped
%e ExampleTriangle begins: 0: 1; 1: 2, 1; 2: 3, 4, 1; 3: 5, 10, 6, 1; 4: 8, 22, 21, 8, 1; 5: 13, 45, 59, 36, 10, 1; 6: 21, 88, 147, 124, 55, 12, 1; 7: 34, 167, 339, 366, 225, 78, 14, 1; 8: 55, 310, 741, 976, 770, 370, 105, 16, 1; 9: 89, 566, 1557, 2422, 2337, 1443, 567, 136, 18, 1;
%F FormulaRow n lists the coefficients of P(n,x) in ascending powers of x, starting at the lowest nonzero coefficient, where (n-1)*P(n,x) = (n-1+(n-1)*x)*P(n-1,x) + (n-1+(n-1)*x)*P(n-2,x) for n >= 2, with P(0,x) = x, P(1,x) = 2*x + x^2.
%t MathematicaP[0, x_] := x;
P[1, x_] := 2*x + x^2;
P[n_, x_] := P[n, x] = Expand[Together[((n - 1 + (n - 1)*x)*P[n - 1, x] + (n - 1 + (n - 1)*x)*P[n - 2, x])/(n - 1)]];
Table[PadRight[CoefficientList[Expand[P[n, x]/x^Exponent[P[n, x], x, Min]], x], n + 1], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = x; v[2] = 2*x + x^2; for(n = 2, N, my(i = n + 1); v[i] = ((n - 1 + (n - 1)*x)*v[i - 1] + (n - 1 + (n - 1)*x)*v[i - 2])/(n - 1)); v};
row(n, p) = {my(c = Vecrev(p/x^valuation(p, x))); c = concat(c, vector(n + 1 - #c)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i - 1, v[i])))};
T(9)polytool c48629374597
A155112 triangle, offset 0, from P0
%e ExampleTriangle begins: 0: 1; 1: 0, 1; 2: 0, 2, 1; 3: 0, 3, 4, 1; 4: 0, 5, 10, 6, 1; 5: 0, 8, 22, 21, 8, 1; 6: 0, 13, 45, 59, 36, 10, 1; 7: 0, 21, 88, 147, 124, 55, 12, 1; 8: 0, 34, 167, 339, 366, 225, 78, 14, 1; 9: 0, 55, 310, 741, 976, 770, 370, 105, 16, 1;
%F FormulaThe row polynomials satisfy (n-2)*P(n,x) = (n-2+(n-2)*x)*P(n-1,x) + (n-2+(n-2)*x)*P(n-2,x) for n >= 3, with P(0,x) = 1, P(1,x) = x, P(2,x) = 2*x + x^2.
%t MathematicaP[0, x_] := 1;
P[1, x_] := x;
P[2, x_] := 2*x + x^2;
P[n_, x_] := P[n, x] = Expand[Together[((n - 2 + (n - 2)*x)*P[n - 1, x] + (n - 2 + (n - 2)*x)*P[n - 2, x])/(n - 2)]];
Table[PadRight[CoefficientList[P[n, x], x], n + 1], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = x; v[3] = 2*x + x^2; for(n = 3, N, my(i = n + 1); v[i] = ((n - 2 + (n - 2)*x)*v[i - 1] + (n - 2 + (n - 2)*x)*v[i - 2])/(n - 2)); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n + 1 - #c)); 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 Liu–Wang theorem for three-term recurrences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Liu–Wang theorem for three-term recurrences
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m ≥ 2
Proof chains ? JSON
Used in 5
- basis_map_A013610 of Triangle T(n,k), 0<=k<=n, read by rows given by [0,2,-1/2,… Image under a basis map u^k -> P_k (A013610)
- basis_map_A007318 of Triangle T(n,k), 0<=k<=n, read by rows given by [0,2,-1/2,… Image under a basis map u^k -> P_k (A007318)
- basis_map_A013609 of Triangle T(n,k), 0<=k<=n, read by rows given by [0,2,-1/2,… Image under a basis map u^k -> P_k (A013609)
- basis_map_A008277 of Triangle T(n,k), 0<=k<=n, read by rows given by [0,2,-1/2,… Image under a basis map u^k -> P_k (A008277)
- basis_map_A013611 of Triangle T(n,k), 0<=k<=n, read by rows given by [0,2,-1/2,… Image under a basis map u^k -> P_k (A013611)
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