A011973 → basis A013611 → D+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-28\,n - 496\,n x + 256\,n x^{2} - 112\,n^{2} + 256\,n^{2} x + 64\,n^{3}\right)\,P_{n}(x) = \left(152 + 1088\,x + 1408\,x^{2} - 2048\,x^{3} - 20\,n - 1200\,n x - 3200\,n x^{2} + 2048\,n x^{3} - 400\,n^{2} - 640\,n^{2} x + 2048\,n^{2} x^{2} + 192\,n^{3} + 512\,n^{3} x\right)\,P_{n-1}(x) + \left(15 + 88\,x - 272\,x^{2} - 2560\,x^{3} - 4096\,x^{4} - 20\,n - 464\,n x - 2560\,n x^{2} - 4096\,n x^{3} - 80\,n^{2} - 576\,n^{2} x - 1024\,n^{2} x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | Pn(1) |
|---|---|---|---|---|---|
| 0 | 1 | 1 | |||
| 1 | 1 | 1 | |||
| 2 | 6 | 4 | 10 | ||
| 3 | 11 | 8 | 19 | ||
| 4 | 25 | 52 | 16 | 93 | |
| 5 | 48 | 136 | 48 | 232 | |
| 6 | 93 | 368 | 336 | 64 | 861 |
| 7 | 173 | 856 | 1120 | 256 | 2405 |
Compute more
?
Technical details
- Node id
n-f67f77f459cfd595· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-9e1a96db7a3abf55
Observed on the stored rows ?
- Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half 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: 1; 2: 6, 4; 3: 11, 8; 4: 25, 52, 16; 5: 48, 136, 48; 6: 93, 368, 336, 64; 7: 173, 856, 1120, 256; 8: 318, 1916, 3504, 1920, 256; 9: 575, 4072, 9456, 7680, 1280;
%F FormulaThe row polynomials satisfy (64*n^3-112*n^2-28*n+(256*n^2-496*n)*x+256*n*x^2)*P(n,x) = (192*n^3-400*n^2-20*n+152+(512*n^3-640*n^2-1200*n+1088)*x+(2048*n^2-3200*n+1408)*x^2+(2048*n-2048)*x^3)*P(n-1,x) - (80*n^2+20*n-15+(576*n^2+464*n-88)*x+(1024*n^2+2560*n+272)*x^2+(4096*n+2560)*x^3+4096*x^4)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((192*n^3 - 400*n^2 - 20*n + 152 + (512*n^3 - 640*n^2 - 1200*n + 1088)*x + (2048*n^2 - 3200*n + 1408)*x^2 + (2048*n - 2048)*x^3)*P[n - 1, x] - (80*n^2 + 20*n - 15 + (576*n^2 + 464*n - 88)*x + (1024*n^2 + 2560*n + 272)*x^2 + (4096*n + 2560)*x^3 + 4096*x^4)*D[P[n - 1, x], x])/(64*n^3 - 112*n^2 - 28*n + (256*n^2 - 496*n)*x + 256*n*x^2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((192*n^3 - 400*n^2 - 20*n + 152 + (512*n^3 - 640*n^2 - 1200*n + 1088)*x + (2048*n^2 - 3200*n + 1408)*x^2 + (2048*n - 2048)*x^3)*v[i - 1] - (80*n^2 + 20*n - 15 + (576*n^2 + 464*n - 88)*x + (1024*n^2 + 2560*n + 272)*x^2 + (4096*n + 2560)*x^3 + 4096*x^4)*deriv(v[i - 1], x))/(64*n^3 - 112*n^2 - 28*n + (256*n^2 - 496*n)*x + 256*n*x^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
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 Laguerre’s theorem on differential operators
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on differential operators
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
basis_map_A013611 of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coef…?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
delannoy?
-
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
delannoy?
- ↑ 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
delannoy?
- ↑ 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
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
Affine-current basis map theorem polytool RealRooted orderTwoConstants_nonneg_iff ? step ›
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
no recorded property covers this requirement
-
from
a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
from
delannoy?
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
from
delannoy?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine-current basis map theorem (above)
- ↑ Affine-current basis map theorem (above)
-
-
from
delannoy?
-
from
Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coefficients of (one vers…?
-
Geometric basis map (elementary) polytool ? step ›
-
-
from
basis_map_A013611 of Irregular triangle read by rows: T(n,k) = binomial(n-k, k), n >= 0, 0 <= k <= floor(n/2); or, coef…?
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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.