A008278 → x ↦ x+1 (shift +1) → x ↦ x+1 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-4\,x + n x^{3}\right)\,P_{n}(x) = \left(-32 - 60\,x - 16\,x^{2} + 15\,x^{3} + 6\,x^{4} + 64\,n + 64\,n x - 5\,n x^{3} + 4\,n x^{4} + n x^{5} + 16\,n^{2} x - 16\,n^{2} x^{3} - 6\,n^{2} x^{4} - 4\,n^{3} x^{3} - 4\,n^{3} x^{4} - n^{3} x^{5}\right)\,P_{n-2}(x) + \left(-64 - 112\,x - 48\,x^{2} + 16\,x^{3} + 16\,x^{4} + 3\,x^{5} - 32\,n x - 32\,n x^{2} + 12\,n x^{3} + 24\,n x^{4} + 9\,n x^{5} + n x^{6} + 8\,n^{2} x^{3} + 12\,n^{2} x^{4} + 6\,n^{2} x^{5} + n^{2} x^{6}\right)\,P_{n-2}'(x) + \left(-32 - 16\,x + 8\,x^{2} + 3\,x^{3} - 16\,n x + 6\,n x^{3} + 4\,n^{2} x^{3} + 2\,n^{2} x^{4}\right)\,P_{n-1}(x) + \left(16\,x + 16\,x^{2} + 4\,x^{3} - 4\,n x^{3} - 4\,n x^{4} - n x^{5}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 3 + 2\,x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | x14 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | ||||||||||||||
| 1 | 3 | 2 | 5 | |||||||||||||
| 2 | 11 | 14 | 3 | 28 | ||||||||||||
| 3 | 49 | 92 | 39 | 4 | 184 | |||||||||||
| 4 | 257 | 644 | 417 | 92 | 5 | 1415 | ||||||||||
| 5 | 1539 | 4854 | 4287 | 1512 | 205 | 6 | 12403 | |||||||||
| 6 | 10299 | 39290 | 44232 | 21752 | 4955 | 450 | 7 | 120985 | ||||||||
| 7 | 75905 | 340472 | 467466 | 296712 | 96305 | 15444 | 987 | 8 | 1293299 | |||||||
| 8 | 609441 | 3147464 | 5111742 | 3990584 | 1693355 | 395628 | 46949 | 2168 | 9 | 14997340 | ||||||
| 9 | 5284451 | 30919274 | 58083474 | 53968736 | 28415645 | 8798694 | 1558403 | 141200 | 4761 | 10 | 187174648 | |||||
| 10 | 49134923 | 321538150 | 686776737 | 741555424 | 467659765 | 181332762 | 43191106 | 6000304 | 423855 | 10430 | 11 | 2497623467 | ||||
| 11 | 487026929 | 3527383892 | 8450724489 | 10412385516 | 7666959895 | 3583837560 | 1079130780 | 204748480 | 22848741 | 1276860 | 22759 | 12 | 35436345913 | |||
| 12 | 5120905441 | 40693177420 | 108152680887 | 149900251572 | 126411350110 | 69322741032 | 25330799760 | 6135588736 | 950398749 | 86676900 | 3871769 | 49428 | 13 | 532108491817 | ||
| 13 | 56878092067 | 492272324062 | 1438275866265 | 2216677811848 | 2108898978660 | 1329411030492 | 572682724880 | 169477244928 | 33854898663 | 4359109350 | 329051767 | 11830392 | 106821 | 14 | 8423129070209 | |
| 14 | 664920021819 | 6228590059346 | 19853003204142 | 33702029734808 | 35738156127290 | 25490585249388 | 12670036943830 | 4442449802496 | 1091833464879 | 183220040170 | 19878372844 | 1253673384 | 36418499 | 229754 | 15 | 140085993342664 |
Compute more
?
Technical details
- Node id
n-91fef0adbb55a62f· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-5545d9de5dd74d0a
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: 3, 2; 2: 11, 14, 3; 3: 49, 92, 39, 4; 4: 257, 644, 417, 92, 5; 5: 1539, 4854, 4287, 1512, 205, 6; 6: 10299, 39290, 44232, 21752, 4955, 450, 7; 7: 75905, 340472, 467466, 296712, 96305, 15444, 987, 8; 8: 609441, 3147464, 5111742, 3990584, 1693355, 395628, 46949, 2168, 9; 9: 5284451, 30919274, 58083474, 53968736, 28415645, 8798694, 1558403, 141200, 4761, 10;
%F FormulaThe row polynomials satisfy -(4*x-n*x^3)*P(n,x) = (64*n-32+(16*n^2+64*n-60)*x-16*x^2-(4*n^3+16*n^2+5*n-15)*x^3-(4*n^3+6*n^2-4*n-6)*x^4-(n^3-n)*x^5)*P(n-2,x) - (64+(32*n+112)*x+(32*n+48)*x^2-(8*n^2+12*n+16)*x^3-(12*n^2+24*n+16)*x^4-(6*n^2+9*n+3)*x^5-(n^2+n)*x^6)*d/dx P(n-2,x) - (32+(16*n+16)*x-8*x^2-(4*n^2+6*n+3)*x^3-2*n^2*x^4)*P(n-1,x) + (16*x+16*x^2-(4*n-4)*x^3-4*n*x^4-n*x^5)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 2*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 3 + 2*x;
P[n_, x_] := P[n, x] = Expand[Together[((64*n - 32 + (16*n^2 + 64*n - 60)*x - 16*x^2 - (4*n^3 + 16*n^2 + 5*n - 15)*x^3 - (4*n^3 + 6*n^2 - 4*n - 6)*x^4 - (n^3 - n)*x^5)*P[n - 2, x] - (64 + (32*n + 112)*x + (32*n + 48)*x^2 - (8*n^2 + 12*n + 16)*x^3 - (12*n^2 + 24*n + 16)*x^4 - (6*n^2 + 9*n + 3)*x^5 - (n^2 + n)*x^6)*D[P[n - 2, x], x] - (32 + (16*n + 16)*x - 8*x^2 - (4*n^2 + 6*n + 3)*x^3 - 2*n^2*x^4)*P[n - 1, x] + (16*x + 16*x^2 - (4*n - 4)*x^3 - 4*n*x^4 - n*x^5)*D[P[n - 1, x], x])/(-4*x + n*x^3)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 3 + 2*x; for(n = 2, N, my(i = n + 1); v[i] = ((64*n - 32 + (16*n^2 + 64*n - 60)*x - 16*x^2 - (4*n^3 + 16*n^2 + 5*n - 15)*x^3 - (4*n^3 + 6*n^2 - 4*n - 6)*x^4 - (n^3 - n)*x^5)*v[i - 2] - (64 + (32*n + 112)*x + (32*n + 48)*x^2 - (8*n^2 + 12*n + 16)*x^3 - (12*n^2 + 24*n + 16)*x^4 - (6*n^2 + 9*n + 3)*x^5 - (n^2 + n)*x^6)*deriv(v[i - 2], x) - (32 + (16*n + 16)*x - 8*x^2 - (4*n^2 + 6*n + 3)*x^3 - 2*n^2*x^4)*v[i - 1] + (16*x + 16*x^2 - (4*n - 4)*x^3 - 4*n*x^4 - n*x^5)*deriv(v[i - 1], x))/(-4*x + n*x^3)); 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
shift_x_plus_one 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.?
-
-
from
shift_x_plus_one 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.