A008278 → x ↦ x+1 (shift +1) → reverse → D
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-4 - 4\,x + n + 2\,n x\right)\,P_{n}(x) = \left(6 + 40\,x + 111\,x^{2} + 130\,x^{3} + 66\,x^{4} + 12\,x^{5} - 2\,n - 22\,n x - 90\,n x^{2} - 146\,n x^{3} - 97\,n x^{4} - 22\,n x^{5} + 2\,n^{2} x + 18\,n^{2} x^{2} + 44\,n^{2} x^{3} + 40\,n^{2} x^{4} + 12\,n^{2} x^{5} - n^{3} x^{2} - 4\,n^{3} x^{3} - 5\,n^{3} x^{4} - 2\,n^{3} x^{5}\right)\,P_{n-2}(x) + \left(3\,x + 20\,x^{2} + 45\,x^{3} + 46\,x^{4} + 22\,x^{5} + 4\,x^{6} - n x - 11\,n x^{2} - 34\,n x^{3} - 45\,n x^{4} - 27\,n x^{5} - 6\,n x^{6} + n^{2} x^{2} + 5\,n^{2} x^{3} + 9\,n^{2} x^{4} + 7\,n^{2} x^{5} + 2\,n^{2} x^{6}\right)\,P_{n-2}'(x) + \left(-11 - 50\,x - 58\,x^{2} - 20\,x^{3} + 3\,n + 24\,n x + 41\,n x^{2} + 18\,n x^{3} - 2\,n^{2} x - 6\,n^{2} x^{2} - 4\,n^{2} x^{3}\right)\,P_{n-1}(x) + \left(-4\,x - 12\,x^{2} - 12\,x^{3} - 4\,x^{4} + n x + 4\,n x^{2} + 5\,n x^{3} + 2\,n x^{4}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 2\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 0 | ||||||||||||||
| 1 | 2 | 2 | |||||||||||||
| 2 | 5 | 10 | 15 | ||||||||||||
| 3 | 10 | 46 | 45 | 101 | |||||||||||
| 4 | 19 | 152 | 327 | 208 | 706 | ||||||||||
| 5 | 36 | 448 | 1593 | 2176 | 1015 | 5268 | |||||||||
| 6 | 69 | 1262 | 6612 | 14564 | 14380 | 5262 | 42149 | ||||||||
| 7 | 134 | 3498 | 25413 | 80356 | 126040 | 96678 | 28980 | 361099 | |||||||
| 8 | 263 | 9676 | 93993 | 400684 | 888155 | 1071384 | 668465 | 169176 | 3301796 | ||||||
| 9 | 520 | 26908 | 341421 | 1887308 | 5547365 | 9358728 | 9117157 | 4777240 | 1043775 | 32100422 | |||||
| 10 | 1033 | 75506 | 1232118 | 8604600 | 32229115 | 71326800 | 96464592 | 78497504 | 35363187 | 6785700 | 330580155 | ||||
| 11 | 2058 | 214102 | 4447545 | 38529256 | 178999980 | 499196076 | 878971331 | 987539424 | 688031694 | 271323240 | 46349567 | 3593604273 | |||
| 12 | 4107 | 613472 | 16122675 | 171002264 | 966537710 | 3304615320 | 7275357082 | 10582574296 | 10136765916 | 6161599740 | 2157350756 | 331733244 | 41104276582 | ||
| 13 | 8204 | 1774680 | 58833921 | 756754280 | 5129880475 | 21080280072 | 56441556178 | 102065021336 | 126029882988 | 104969311580 | 56497664520 | 17766375420 | 2481691186 | 493279034840 | |
| 14 | 16397 | 5176342 | 216406200 | 3352502300 | 26960888950 | 131189921154 | 418671448188 | 915349818248 | 1399008284379 | 1496988467270 | 1101022064274 | 531045333012 | 151413529449 | 19361419630 | 6194585275793 |
Compute more
?
Technical details
- Node id
n-801c96cbd9fb40ce· revision 0 · JSON- Definition source
derived:derivative- Fingerprint
f6-f6a909163e19896b
Observed on the stored rows ?
- Degrees: -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (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 = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 0; 1: 2; 2: 5, 10; 3: 10, 46, 45; 4: 19, 152, 327, 208; 5: 36, 448, 1593, 2176, 1015; 6: 69, 1262, 6612, 14564, 14380, 5262; 7: 134, 3498, 25413, 80356, 126040, 96678, 28980; 8: 263, 9676, 93993, 400684, 888155, 1071384, 668465, 169176; 9: 520, 26908, 341421, 1887308, 5547365, 9358728, 9117157, 4777240, 1043775;
%F FormulaThe row polynomials satisfy (n-4+(2*n-4)*x)*P(n,x) = -(2*n-6-(2*n^2-22*n+40)*x+(n^3-18*n^2+90*n-111)*x^2+(4*n^3-44*n^2+146*n-130)*x^3+(5*n^3-40*n^2+97*n-66)*x^4+(2*n^3-12*n^2+22*n-12)*x^5)*P(n-2,x) - ((n-3)*x-(n^2-11*n+20)*x^2-(5*n^2-34*n+45)*x^3-(9*n^2-45*n+46)*x^4-(7*n^2-27*n+22)*x^5-(2*n^2-6*n+4)*x^6)*d/dx P(n-2,x) + (3*n-11-(2*n^2-24*n+50)*x-(6*n^2-41*n+58)*x^2-(4*n^2-18*n+20)*x^3)*P(n-1,x) + ((n-4)*x+(4*n-12)*x^2+(5*n-12)*x^3+(2*n-4)*x^4)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 2.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 2;
P[n_, x_] := P[n, x] = Expand[Together[(-(2*n - 6 - (2*n^2 - 22*n + 40)*x + (n^3 - 18*n^2 + 90*n - 111)*x^2 + (4*n^3 - 44*n^2 + 146*n - 130)*x^3 + (5*n^3 - 40*n^2 + 97*n - 66)*x^4 + (2*n^3 - 12*n^2 + 22*n - 12)*x^5)*P[n - 2, x] - ((n - 3)*x - (n^2 - 11*n + 20)*x^2 - (5*n^2 - 34*n + 45)*x^3 - (9*n^2 - 45*n + 46)*x^4 - (7*n^2 - 27*n + 22)*x^5 - (2*n^2 - 6*n + 4)*x^6)*D[P[n - 2, x], x] + (3*n - 11 - (2*n^2 - 24*n + 50)*x - (6*n^2 - 41*n + 58)*x^2 - (4*n^2 - 18*n + 20)*x^3)*P[n - 1, x] + ((n - 4)*x + (4*n - 12)*x^2 + (5*n - 12)*x^3 + (2*n - 4)*x^4)*D[P[n - 1, x], x])/(n - 4 + (2*n - 4)*x)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 2; for(n = 2, N, my(i = n + 1); v[i] = (-(2*n - 6 - (2*n^2 - 22*n + 40)*x + (n^3 - 18*n^2 + 90*n - 111)*x^2 + (4*n^3 - 44*n^2 + 146*n - 130)*x^3 + (5*n^3 - 40*n^2 + 97*n - 66)*x^4 + (2*n^3 - 12*n^2 + 22*n - 12)*x^5)*v[i - 2] - ((n - 3)*x - (n^2 - 11*n + 20)*x^2 - (5*n^2 - 34*n + 45)*x^3 - (9*n^2 - 45*n + 46)*x^4 - (7*n^2 - 27*n + 22)*x^5 - (2*n^2 - 6*n + 4)*x^6)*deriv(v[i - 2], x) + (3*n - 11 - (2*n^2 - 24*n + 50)*x - (6*n^2 - 41*n + 58)*x^2 - (4*n^2 - 18*n + 20)*x^3)*v[i - 1] + ((n - 4)*x + (4*n - 12)*x^2 + (5*n - 12)*x^3 + (2*n - 4)*x^4)*deriv(v[i - 1], x))/(n - 4 + (2*n - 4)*x)); 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
reversal of Triangle T(n,k) of numbers with e.g.f. exp((exp((1+x)*y)-1)/(1+x)), k=0..n-1.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k) of numbers with e.g.f. exp((exp((1+x)*y)-1)/(1+x)), k=0..n-1.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.?
- ↑ Liu–Wang theorem (above)
- ↑ Iterated real-rootedness preservers (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- from Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
-
from
Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.?
- ↑ Ray basis map theorem (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle of Stirling numbers of the second kind, S2(n,k), n >= 1, 1 <= k <= n.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Reflected triangle of Stirling numbers of 2nd kind, S(n,n-k+1), n >= 1, 1 <= k <= n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle T(n,k) of numbers with e.g.f. exp((exp((1+x)*y)-1)/(1+x)), k=0..n-1.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
basis_map_A008277 of a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle of Stirling numbers of 2nd kind, S(n,k), n >= 0, 0 <= k <= n.?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
basis-map coefficients of Triangle of Stirling numbers of 2nd kind, S(n,k), n >= 0, 0 <= k <= n.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
basis-map coefficients of Triangle of Stirling numbers of 2nd kind, S(n,k), n >= 0, 0 <= k <= n.?
-
from
Triangle of Stirling numbers of 2nd kind, S(n,k), n >= 0, 0 <= k <= n.?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
-
from
basis_map_A008277 of a(n) = 1 if n is of the form m(m+3)/2, otherwise 0.?
-
from
reversal of Triangle T(n,k) of numbers with e.g.f. exp((exp((1+x)*y)-1)/(1+x)), k=0..n-1.?
-
-
from
Triangle T(n,k) of numbers with e.g.f. exp((exp((1+x)*y)-1)/(1+x)), k=0..n-1.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
reversal of Triangle T(n,k) of numbers with e.g.f. exp((exp((1+x)*y)-1)/(1+x)), k=0..n-1.?
References
- [ASW52] Michael Aissen, I. J. Schoenberg and A. M. Whitney. On the generating functions of totally positive sequences I. Journal d’Analyse Mathématique, 2(1):93–103, 1952. doi:10.1007/BF02786970
- [AW24] Christos A. Athanasiadis and David G. Wagner. Veronese sections and interlacing matrices of polynomials and formal power series. arXiv:2404.12989. arXiv
- [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
- [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
- [Edr53] Albert Edrei. Proof of a Conjecture of Schoenberg on the Generating Function of a Totally Positive Sequence. Canadian Journal of Mathematics, 5:86–94, 1953. doi:10.4153/CJM-1953-010-3
- [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
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.