A008288 → basis A013610 → x ↦ x/(x+1)
nonnegative coefficients
Proved for all n all roots real, in [−1, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-9 - 27\,x - 27\,x^{2} - 9\,x^{3} + 9\,n + 27\,n x + 27\,n x^{2} + 9\,n x^{3}\right)\,P_{n}(x) = \left(324 + 2487\,x + 7719\,x^{2} + 12459\,x^{3} + 11073\,x^{4} + 5154\,x^{5} + 984\,x^{6} - 253\,n - 1914\,n x - 5973\,n x^{2} - 9785\,n x^{3} - 8862\,n x^{4} - 4209\,n x^{5} - 820\,n x^{6} + 50\,n^{2} + 360\,n^{2} x + 1104\,n^{2} x^{2} + 1816\,n^{2} x^{3} + 1674\,n^{2} x^{4} + 816\,n^{2} x^{5} + 164\,n^{2} x^{6}\right)\,P_{n-1}(x) + \left(132 + 1407\,x + 6012\,x^{2} + 13602\,x^{3} + 17808\,x^{4} + 13599\,x^{5} + 5640\,x^{6} + 984\,x^{7} - 40\,n - 424\,n x - 1821\,n x^{2} - 4172\,n x^{3} - 5558\,n x^{4} - 4332\,n x^{5} - 1837\,n x^{6} - 328\,n x^{7}\right)\,P_{n-1}'(x) + \left(8 + 112\,x + 641\,x^{2} + 1969\,x^{3} + 3590\,x^{4} + 4018\,x^{5} + 2717\,x^{6} + 1021\,x^{7} + 164\,x^{8}\right)\,P_{n-1}''(x)\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | |||||||
| 2 | 2 | 5 | 7 | ||||||
| 3 | 5 | 25 | 29 | 59 | |||||
| 4 | 12 | 90 | 216 | 165 | 483 | ||||
| 5 | 29 | 290 | 1056 | 1655 | 941 | 3971 | |||
| 6 | 70 | 875 | 4276 | 10195 | 11846 | 5365 | 32627 | ||
| 7 | 169 | 2535 | 15549 | 49865 | 88107 | 81285 | 30589 | 268099 | |
| 8 | 408 | 7140 | 52704 | 212550 | 505464 | 708480 | 541812 | 174405 | 2202963 |
Compute more
?
Technical details
- Node id
n-aa888503b825694f· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-830711f8ecdf3b7b
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 -1)
- 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 = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 1; 2: 2, 5; 3: 5, 25, 29; 4: 12, 90, 216, 165; 5: 29, 290, 1056, 1655, 941; 6: 70, 875, 4276, 10195, 11846, 5365; 7: 169, 2535, 15549, 49865, 88107, 81285, 30589; 8: 408, 7140, 52704, 212550, 505464, 708480, 541812, 174405; 9: 985, 19700, 170008, 826370, 2473306, 4665560, 5415466, 3535955, 994381; 10: 2378, 53505, 528552, 3007410, 10857492, 25783650, 40264800, 39866625, 22707810, 5669525;
%F FormulaThe row polynomials satisfy (9*n-9+(27*n-27)*x+(27*n-27)*x^2+(9*n-9)*x^3)*P(n,x) = (50*n^2-253*n+324+(360*n^2-1914*n+2487)*x+(1104*n^2-5973*n+7719)*x^2+(1816*n^2-9785*n+12459)*x^3+(1674*n^2-8862*n+11073)*x^4+(816*n^2-4209*n+5154)*x^5+(164*n^2-820*n+984)*x^6)*P(n-1,x) - (40*n-132+(424*n-1407)*x+(1821*n-6012)*x^2+(4172*n-13602)*x^3+(5558*n-17808)*x^4+(4332*n-13599)*x^5+(1837*n-5640)*x^6+(328*n-984)*x^7)*d/dx P(n-1,x) + (8+112*x+641*x^2+1969*x^3+3590*x^4+4018*x^5+2717*x^6+1021*x^7+164*x^8)*d^2/dx^2 P(n-1,x) for n >= 2, with P(1,x) = 1.
%t MathematicaP[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((50*n^2 - 253*n + 324 + (360*n^2 - 1914*n + 2487)*x + (1104*n^2 - 5973*n + 7719)*x^2 + (1816*n^2 - 9785*n + 12459)*x^3 + (1674*n^2 - 8862*n + 11073)*x^4 + (816*n^2 - 4209*n + 5154)*x^5 + (164*n^2 - 820*n + 984)*x^6)*P[n - 1, x] - (40*n - 132 + (424*n - 1407)*x + (1821*n - 6012)*x^2 + (4172*n - 13602)*x^3 + (5558*n - 17808)*x^4 + (4332*n - 13599)*x^5 + (1837*n - 5640)*x^6 + (328*n - 984)*x^7)*D[P[n - 1, x], x] + (8 + 112*x + 641*x^2 + 1969*x^3 + 3590*x^4 + 4018*x^5 + 2717*x^6 + 1021*x^7 + 164*x^8)*D[P[n - 1, x], {x, 2}])/(9*n - 9 + (27*n - 27)*x + (27*n - 27)*x^2 + (9*n - 9)*x^3)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = ((50*n^2 - 253*n + 324 + (360*n^2 - 1914*n + 2487)*x + (1104*n^2 - 5973*n + 7719)*x^2 + (1816*n^2 - 9785*n + 12459)*x^3 + (1674*n^2 - 8862*n + 11073)*x^4 + (816*n^2 - 4209*n + 5154)*x^5 + (164*n^2 - 820*n + 984)*x^6)*v[i - 1] - (40*n - 132 + (424*n - 1407)*x + (1821*n - 6012)*x^2 + (4172*n - 13602)*x^3 + (5558*n - 17808)*x^4 + (4332*n - 13599)*x^5 + (1837*n - 5640)*x^6 + (328*n - 984)*x^7)*deriv(v[i - 1], x) + (8 + 112*x + 641*x^2 + 1969*x^3 + 3590*x^4 + 4018*x^5 + 2717*x^6 + 1021*x^7 + 164*x^8)*deriv(deriv(v[i - 1], x), x))/(9*n - 9 + (27*n - 27)*x + (27*n - 27)*x^2 + (9*n - 9)*x^3)); v};
row(n, p) = {my(c = Vecrev(p)); 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 ≥ 1, is zero or real-rooted with all roots in [-1, 0]
- Coefficients of one sign? Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A013610 of Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
-
Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ Liu–Wang theorem with a lag row (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ Liu–Wang theorem with a lag row (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
no recorded property covers this requirement
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
no recorded property covers this requirement
-
from
basis-map coefficients of Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by downwar…?
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
- ↑ Liu–Wang theorem with a lag row (above)
- ↑ Liu–Wang theorem for three-term recurrences (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
-
-
from
basis_map_A013610 of Square array of Delannoy numbers D(i,j) (i >= 0, j >= 0) read by antidiagonals.?
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