A008278 → x ↦ x+1 (shift +1) → reverse → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-2 - 2\,x + n + 2\,n x\right)\,P_{n}(x) = \left(7\,x^{2} + 8\,x^{3} + 2\,x^{4} - 12\,n x^{2} - 30\,n x^{3} - 21\,n x^{4} - 4\,n x^{5} + 6\,n^{2} x^{2} + 20\,n^{2} x^{3} + 20\,n^{2} x^{4} + 6\,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(2\,x^{2} + 5\,x^{3} + 4\,x^{4} + x^{5} - 3\,n x^{2} - 12\,n x^{3} - 17\,n x^{4} - 10\,n x^{5} - 2\,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(-2 - 14\,x - 17\,x^{2} - 6\,x^{3} + n + 12\,n x + 23\,n x^{2} + 10\,n x^{3} - 2\,n^{2} x - 6\,n^{2} x^{2} - 4\,n^{2} x^{3}\right)\,P_{n-1}(x) + \left(-2\,x - 6\,x^{2} - 6\,x^{3} - 2\,x^{4} + n x + 4\,n x^{2} + 5\,n x^{3} + 2\,n x^{4}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1 + 4\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 1 | 4 | 5 | |||||||||||||
| 2 | 1 | 10 | 15 | 26 | ||||||||||||
| 3 | 1 | 20 | 69 | 60 | 150 | |||||||||||
| 4 | 1 | 38 | 228 | 436 | 260 | 963 | ||||||||||
| 5 | 1 | 72 | 672 | 2124 | 2720 | 1218 | 6807 | |||||||||
| 6 | 1 | 138 | 1893 | 8816 | 18205 | 17256 | 6139 | 52448 | ||||||||
| 7 | 1 | 268 | 5247 | 33884 | 100445 | 151248 | 112791 | 33120 | 437004 | |||||||
| 8 | 1 | 526 | 14514 | 125324 | 500855 | 1065786 | 1249948 | 763960 | 190323 | 3911237 | ||||||
| 9 | 1 | 1040 | 40362 | 455228 | 2359135 | 6656838 | 10918516 | 10419608 | 5374395 | 1159750 | 37384873 | |||||
| 10 | 1 | 2066 | 113259 | 1642824 | 10755750 | 38674938 | 83214600 | 110245248 | 88309692 | 39292430 | 7464270 | 379715078 | ||||
| 11 | 1 | 4116 | 321153 | 5930060 | 48161570 | 214799976 | 582395422 | 1004538664 | 1110981852 | 764479660 | 298455564 | 50563164 | 4080631202 | |||
| 12 | 1 | 8214 | 920208 | 21496900 | 213752830 | 1159845252 | 3855384540 | 8314693808 | 11905396083 | 11263073240 | 6777759714 | 2353473552 | 359377681 | 46225182023 | ||
| 13 | 1 | 16408 | 2662020 | 78445228 | 945942850 | 6155856570 | 24593660084 | 64504635632 | 114823149003 | 140033203320 | 115466242738 | 61633815840 | 19246906705 | 2672590508 | 550157126907 | |
| 14 | 1 | 32794 | 7764513 | 288541600 | 4190627875 | 32353066740 | 153054908013 | 478481655072 | 1029768545529 | 1554453649310 | 1646687313997 | 1201114979208 | 575299110763 | 163060724022 | 20744378175 | 6859505297612 |
Compute more
?
Technical details
- Node id
n-fc79b5a7d82bc0ba· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-728b95eb80c88fcb
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: 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, 4; 2: 1, 10, 15; 3: 1, 20, 69, 60; 4: 1, 38, 228, 436, 260; 5: 1, 72, 672, 2124, 2720, 1218; 6: 1, 138, 1893, 8816, 18205, 17256, 6139; 7: 1, 268, 5247, 33884, 100445, 151248, 112791, 33120; 8: 1, 526, 14514, 125324, 500855, 1065786, 1249948, 763960, 190323; 9: 1, 1040, 40362, 455228, 2359135, 6656838, 10918516, 10419608, 5374395, 1159750;
%F FormulaThe row polynomials satisfy (n-2+(2*n-2)*x)*P(n,x) = -((n^3-6*n^2+12*n-7)*x^2+(4*n^3-20*n^2+30*n-8)*x^3+(5*n^3-20*n^2+21*n-2)*x^4+(2*n^3-6*n^2+4*n)*x^5)*P(n-2,x) + ((n^2-3*n+2)*x^2+(5*n^2-12*n+5)*x^3+(9*n^2-17*n+4)*x^4+(7*n^2-10*n+1)*x^5+(2*n^2-2*n)*x^6)*d/dx P(n-2,x) + (n-2-(2*n^2-12*n+14)*x-(6*n^2-23*n+17)*x^2-(4*n^2-10*n+6)*x^3)*P(n-1,x) + ((n-2)*x+(4*n-6)*x^2+(5*n-6)*x^3+(2*n-2)*x^4)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 4*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 1 + 4*x;
P[n_, x_] := P[n, x] = Expand[Together[(-((n^3 - 6*n^2 + 12*n - 7)*x^2 + (4*n^3 - 20*n^2 + 30*n - 8)*x^3 + (5*n^3 - 20*n^2 + 21*n - 2)*x^4 + (2*n^3 - 6*n^2 + 4*n)*x^5)*P[n - 2, x] + ((n^2 - 3*n + 2)*x^2 + (5*n^2 - 12*n + 5)*x^3 + (9*n^2 - 17*n + 4)*x^4 + (7*n^2 - 10*n + 1)*x^5 + (2*n^2 - 2*n)*x^6)*D[P[n - 2, x], x] + (n - 2 - (2*n^2 - 12*n + 14)*x - (6*n^2 - 23*n + 17)*x^2 - (4*n^2 - 10*n + 6)*x^3)*P[n - 1, x] + ((n - 2)*x + (4*n - 6)*x^2 + (5*n - 6)*x^3 + (2*n - 2)*x^4)*D[P[n - 1, x], x])/(n - 2 + (2*n - 2)*x)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = (-((n^3 - 6*n^2 + 12*n - 7)*x^2 + (4*n^3 - 20*n^2 + 30*n - 8)*x^3 + (5*n^3 - 20*n^2 + 21*n - 2)*x^4 + (2*n^3 - 6*n^2 + 4*n)*x^5)*v[i - 2] + ((n^2 - 3*n + 2)*x^2 + (5*n^2 - 12*n + 5)*x^3 + (9*n^2 - 17*n + 4)*x^4 + (7*n^2 - 10*n + 1)*x^5 + (2*n^2 - 2*n)*x^6)*deriv(v[i - 2], x) + (n - 2 - (2*n^2 - 12*n + 14)*x - (6*n^2 - 23*n + 17)*x^2 - (4*n^2 - 10*n + 6)*x^3)*v[i - 1] + ((n - 2)*x + (4*n - 6)*x^2 + (5*n - 6)*x^3 + (2*n - 2)*x^4)*deriv(v[i - 1], x))/(n - 2 + (2*n - 2)*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 multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on multiplier sequences
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] 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.