A153655: Triangle T(n, k, j) = T(n-1, k, j) + T(n-1, k-1, j) + (2*j + 1)*prime(j)*T(n-2, k-1, j) with T(2, k, j) = prime(j) and j = 10, read by rows.
A153655 ↗ palindromicγ-positivenonnegative coefficients
Proved for all n all roots real, in (−∞, 0)coefficients of one signHadamard kernelinterlacinginterlacing (weak)
Recurrence from A153655
\(\left(-3 + n\right)\,P_{n}(x) = \left(-3 - 3\,x + n + n x\right)\,P_{n-1}(x) + \left(-1827\,x + 609\,n x\right)\,P_{n-2}(x)\)
\(P_{0}(x) = 2\)
\(P_{1}(x) = 29 + 29\,x\)
\(P_{2}(x) = 2 + 1678\,x + 2\,x^{2}\)
\(P_{3}(x) = 2 + 24387\,x + 24387\,x^{2} + 2\,x^{3}\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 2 | 2 | |||||||
| 1 | 29 | 29 | 58 | ||||||
| 2 | 2 | 1678 | 2 | 1682 | |||||
| 3 | 2 | 24387 | 24387 | 2 | 48778 | ||||
| 4 | 2 | 25607 | 1070676 | 25607 | 2 | 1121894 | |||
| 5 | 2 | 26827 | 15947966 | 15947966 | 26827 | 2 | 31949590 | ||
| 6 | 2 | 28047 | 31569456 | 683937616 | 31569456 | 28047 | 2 | 747132626 | |
| 7 | 2 | 29267 | 47935146 | 10427818366 | 10427818366 | 47935146 | 29267 | 2 | 20951565562 |
All 15 rows b-files: A153655, A153655 (reversed triangle) ?
Compute more
?
Technical details
- Node id
n-c58311bf3be5222b· revision 0 · JSON- Definition source
oeis_catalog:A153655- Fingerprint
f6-085470e9725ff42c
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: yes
- γ-positive (gamma_positive): yes
- Nonnegative coefficients (
nonn): yes - Only rational roots (
rr_by_factors: every nonzero row is a product of linear factors over ℚ): no
Matches ?
- A153655 reversed triangle 45 terms, 9 rows · tabl · nonn · catalog b-file?
- A153655 triangle 45 terms, 9 rows · tabl · nonn · catalog b-file?
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 2; 1: 29, 29; 2: 2, 1678, 2; 3: 2, 24387, 24387, 2; 4: 2, 25607, 1070676, 25607, 2; 5: 2, 26827, 15947966, 15947966, 26827, 2; 6: 2, 28047, 31569456, 683937616, 31569456, 28047, 2; 7: 2, 29267, 47935146, 10427818366, 10427818366, 47935146, 29267, 2; 8: 2, 30487, 65045036, 29701552216, 437373644876, 29701552216, 65045036, 30487, 2; 9: 2, 31707, 82899126, 58959101166, 6817616581986, 6817616581986, 58959101166, 82899126, 31707, 2;
%F FormulaThe row polynomials satisfy (n-3)*P(n,x) = (n-3+(n-3)*x)*P(n-1,x) + (609*n-1827)*x*P(n-2,x) for n >= 4, with P(0,x) = 2, P(1,x) = 29 + 29*x, P(2,x) = 2 + 1678*x + 2*x^2, P(3,x) = 2 + 24387*x + 24387*x^2 + 2*x^3.
%t MathematicaP[0, x_] := 2;
P[1, x_] := 29 + 29*x;
P[2, x_] := 2 + 1678*x + 2*x^2;
P[3, x_] := 2 + 24387*x + 24387*x^2 + 2*x^3;
P[n_, x_] := P[n, x] = Expand[Together[((n - 3 + (n - 3)*x)*P[n - 1, x] + (609*n - 1827)*x*P[n - 2, x])/(n - 3)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 2; v[2] = 29 + 29*x; v[3] = 2 + 1678*x + 2*x^2; v[4] = 2 + 24387*x + 24387*x^2 + 2*x^3; for(n = 4, N, my(i = n + 1); v[i] = ((n - 3 + (n - 3)*x)*v[i - 1] + (609*n - 1827)*x*v[i - 2])/(n - 3)); 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
A153655 triangle, offset 1, from P0
%e ExampleTriangle begins: 1: 2; 2: 29, 29; 3: 2, 1678, 2; 4: 2, 24387, 24387, 2; 5: 2, 25607, 1070676, 25607, 2; 6: 2, 26827, 15947966, 15947966, 26827, 2; 7: 2, 28047, 31569456, 683937616, 31569456, 28047, 2; 8: 2, 29267, 47935146, 10427818366, 10427818366, 47935146, 29267, 2; 9: 2, 30487, 65045036, 29701552216, 437373644876, 29701552216, 65045036, 30487, 2; 10: 2, 31707, 82899126, 58959101166, 6817616581986, 6817616581986, 58959101166, 82899126, 31707, 2;
%F FormulaThe row polynomials satisfy (n-4)*P(n,x) = (n-4+(n-4)*x)*P(n-1,x) + (609*n-2436)*x*P(n-2,x) for n >= 5, with P(1,x) = 2, P(2,x) = 29 + 29*x, P(3,x) = 2 + 1678*x + 2*x^2, P(4,x) = 2 + 24387*x + 24387*x^2 + 2*x^3.
%t MathematicaP[1, x_] := 2;
P[2, x_] := 29 + 29*x;
P[3, x_] := 2 + 1678*x + 2*x^2;
P[4, x_] := 2 + 24387*x + 24387*x^2 + 2*x^3;
P[n_, x_] := P[n, x] = Expand[Together[((n - 4 + (n - 4)*x)*P[n - 1, x] + (609*n - 2436)*x*P[n - 2, x])/(n - 4)]];
Table[PadRight[CoefficientList[P[n, x], x], n], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 2; v[2] = 29 + 29*x; v[3] = 2 + 1678*x + 2*x^2; v[4] = 2 + 24387*x + 24387*x^2 + 2*x^3; for(n = 5, N, my(i = n); v[i] = ((n - 4 + (n - 4)*x)*v[i - 1] + (609*n - 2436)*x*v[i - 2])/(n - 4)); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n - #c)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)polytool c48629374597
A153655 reversed triangle, offset 1, from P0
%e ExampleTriangle begins: 1: 2; 2: 29, 29; 3: 2, 1678, 2; 4: 2, 24387, 24387, 2; 5: 2, 25607, 1070676, 25607, 2; 6: 2, 26827, 15947966, 15947966, 26827, 2; 7: 2, 28047, 31569456, 683937616, 31569456, 28047, 2; 8: 2, 29267, 47935146, 10427818366, 10427818366, 47935146, 29267, 2; 9: 2, 30487, 65045036, 29701552216, 437373644876, 29701552216, 65045036, 30487, 2; 10: 2, 31707, 82899126, 58959101166, 6817616581986, 6817616581986, 58959101166, 82899126, 31707, 2;
%F FormulaRow n lists the coefficients of P(n,x) in descending powers of x, where (n-4)*P(n,x) = (n-4+(n-4)*x)*P(n-1,x) + (609*n-2436)*x*P(n-2,x) for n >= 5, with P(1,x) = 2, P(2,x) = 29 + 29*x, P(3,x) = 2 + 1678*x + 2*x^2, P(4,x) = 2 + 24387*x + 24387*x^2 + 2*x^3.
%t MathematicaP[1, x_] := 2;
P[2, x_] := 29 + 29*x;
P[3, x_] := 2 + 1678*x + 2*x^2;
P[4, x_] := 2 + 24387*x + 24387*x^2 + 2*x^3;
P[n_, x_] := P[n, x] = Expand[Together[((n - 4 + (n - 4)*x)*P[n - 1, x] + (609*n - 2436)*x*P[n - 2, x])/(n - 4)]];
Table[Reverse[PadRight[CoefficientList[P[n, x], x], n]], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 2; v[2] = 29 + 29*x; v[3] = 2 + 1678*x + 2*x^2; v[4] = 2 + 24387*x + 24387*x^2 + 2*x^3; for(n = 5, N, my(i = n); v[i] = ((n - 4 + (n - 4)*x)*v[i - 1] + (609*n - 2436)*x*v[i - 2])/(n - 4)); v};
row(n, p) = {my(c = Vecrev(p)); c = concat(c, vector(n - #c)); c = Vecrev(c); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)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)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (strict, previous interlaces next) for every m ≥ 3
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, previous interlaces next) for every m ≥ 3
Proof chains ? JSON
-
Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ? step › direct check
Used in 4
- basis_map_A007318 of Triangle T(n, k, j) = T(n-1, k, j) + T(n-1, k-1, j) + (2*… Image under a basis map u^k -> P_k (A007318)
- basis_map_A013610 of Triangle T(n, k, j) = T(n-1, k, j) + T(n-1, k-1, j) + (2*… Image under a basis map u^k -> P_k (A013610)
- basis_map_A013609 of Triangle T(n, k, j) = T(n-1, k, j) + T(n-1, k-1, j) + (2*… Image under a basis map u^k -> P_k (A013609)
- basis_map_A008277 of Triangle T(n, k, j) = T(n-1, k, j) + T(n-1, k-1, j) + (2*… Image under a basis map u^k -> P_k (A008277)
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