A008288 → basis A013609 → x ↦ x/(x+1)
nonnegative coefficients
Proved for all n all roots real, in [−1, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-1 - 3\,x - 3\,x^{2} - x^{3} + n + 3\,n x + 3\,n x^{2} + n x^{3}\right)\,P_{n}(x) = \left(52 + 376\,x + 1112\,x^{2} + 1726\,x^{3} + 1486\,x^{4} + 674\,x^{5} + 126\,x^{6} - 41\,n - 295\,n x - 877\,n x^{2} - 1376\,n x^{3} - 1201\,n x^{4} - 553\,n x^{5} - 105\,n x^{6} + 8\,n^{2} + 56\,n^{2} x + 165\,n^{2} x^{2} + 260\,n^{2} x^{3} + 230\,n^{2} x^{4} + 108\,n^{2} x^{5} + 21\,n^{2} x^{6}\right)\,P_{n-1}(x) + \left(26 + 247\,x + 969\,x^{2} + 2052\,x^{3} + 2548\,x^{4} + 1863\,x^{5} + 745\,x^{6} + 126\,x^{7} - 8\,n - 76\,n x - 300\,n x^{2} - 642\,n x^{3} - 808\,n x^{4} - 600\,n x^{5} - 244\,n x^{6} - 42\,n x^{7}\right)\,P_{n-1}'(x) + \left(2 + 24\,x + 121\,x^{2} + 336\,x^{3} + 565\,x^{4} + 592\,x^{5} + 379\,x^{6} + 136\,x^{7} + 21\,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 | 4 | 6 | ||||||
| 3 | 5 | 20 | 19 | 44 | |||||
| 4 | 12 | 72 | 140 | 88 | 312 | ||||
| 5 | 29 | 232 | 682 | 872 | 409 | 2224 | |||
| 6 | 70 | 700 | 2756 | 5336 | 5078 | 1900 | 15840 | ||
| 7 | 169 | 2028 | 10009 | 25992 | 37443 | 28364 | 8827 | 112832 | |
| 8 | 408 | 5712 | 33896 | 110480 | 213544 | 244720 | 153944 | 41008 | 803712 |
Compute more
?
Technical details
- Node id
n-35ed341964ed7074· revision 0 · JSON- Definition source
derived:mobius_x_over_x_plus_one- Fingerprint
f6-c569cb6e352750ae
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, 4; 3: 5, 20, 19; 4: 12, 72, 140, 88; 5: 29, 232, 682, 872, 409; 6: 70, 700, 2756, 5336, 5078, 1900; 7: 169, 2028, 10009, 25992, 37443, 28364, 8827; 8: 408, 5712, 33896, 110480, 213544, 244720, 153944, 41008; 9: 985, 15760, 109268, 428656, 1040446, 1599728, 1521380, 818192, 190513; 10: 2378, 42804, 339544, 1557584, 4552668, 8791576, 11215128, 9112848, 4279658, 885076;
%F FormulaThe row polynomials satisfy (n-1+(3*n-3)*x+(3*n-3)*x^2+(n-1)*x^3)*P(n,x) = (8*n^2-41*n+52+(56*n^2-295*n+376)*x+(165*n^2-877*n+1112)*x^2+(260*n^2-1376*n+1726)*x^3+(230*n^2-1201*n+1486)*x^4+(108*n^2-553*n+674)*x^5+(21*n^2-105*n+126)*x^6)*P(n-1,x) - (8*n-26+(76*n-247)*x+(300*n-969)*x^2+(642*n-2052)*x^3+(808*n-2548)*x^4+(600*n-1863)*x^5+(244*n-745)*x^6+(42*n-126)*x^7)*d/dx P(n-1,x) + (2+24*x+121*x^2+336*x^3+565*x^4+592*x^5+379*x^6+136*x^7+21*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[((8*n^2 - 41*n + 52 + (56*n^2 - 295*n + 376)*x + (165*n^2 - 877*n + 1112)*x^2 + (260*n^2 - 1376*n + 1726)*x^3 + (230*n^2 - 1201*n + 1486)*x^4 + (108*n^2 - 553*n + 674)*x^5 + (21*n^2 - 105*n + 126)*x^6)*P[n - 1, x] - (8*n - 26 + (76*n - 247)*x + (300*n - 969)*x^2 + (642*n - 2052)*x^3 + (808*n - 2548)*x^4 + (600*n - 1863)*x^5 + (244*n - 745)*x^6 + (42*n - 126)*x^7)*D[P[n - 1, x], x] + (2 + 24*x + 121*x^2 + 336*x^3 + 565*x^4 + 592*x^5 + 379*x^6 + 136*x^7 + 21*x^8)*D[P[n - 1, x], {x, 2}])/(n - 1 + (3*n - 3)*x + (3*n - 3)*x^2 + (n - 1)*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] = ((8*n^2 - 41*n + 52 + (56*n^2 - 295*n + 376)*x + (165*n^2 - 877*n + 1112)*x^2 + (260*n^2 - 1376*n + 1726)*x^3 + (230*n^2 - 1201*n + 1486)*x^4 + (108*n^2 - 553*n + 674)*x^5 + (21*n^2 - 105*n + 126)*x^6)*v[i - 1] - (8*n - 26 + (76*n - 247)*x + (300*n - 969)*x^2 + (642*n - 2052)*x^3 + (808*n - 2548)*x^4 + (600*n - 1863)*x^5 + (244*n - 745)*x^6 + (42*n - 126)*x^7)*deriv(v[i - 1], x) + (2 + 24*x + 121*x^2 + 336*x^3 + 565*x^4 + 592*x^5 + 379*x^6 + 136*x^7 + 21*x^8)*deriv(deriv(v[i - 1], x), x))/(n - 1 + (3*n - 3)*x + (3*n - 3)*x^2 + (n - 1)*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_A013609 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_A013609 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