A137597 → reverse → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(1 - 2\,x + n + 2\,n x\right)\,P_{n}(x) = \left(-2 + 10\,x^{2} + 8\,x^{3} - 4\,x^{4} - n - 6\,n x - n x^{2} + 18\,n x^{3} + 12\,n x^{4} - 4\,n x^{5} - 2\,n^{2} x - 9\,n^{2} x^{2} - 8\,n^{2} x^{3} + 5\,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} + 4\,x^{3} - 2\,x^{5} + n x^{2} + 6\,n x^{3} + 8\,n x^{4} + n x^{5} - 2\,n x^{6} + n^{2} x^{3} + 4\,n^{2} x^{4} + 5\,n^{2} x^{5} + 2\,n^{2} x^{6}\right)\,P_{n-2}'(x) + \left(3 - 5\,x^{2} + 6\,x^{3} + 2\,n + 8\,n x - 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(-x^{2} + x^{3} + 2\,x^{4} - n x^{2} - 3\,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 | 18 | 66 | 60 | 145 | |||||||||||
| 4 | 1 | 28 | 183 | 396 | 260 | 868 | ||||||||||
| 5 | 1 | 40 | 405 | 1540 | 2355 | 1218 | 5559 | |||||||||
| 6 | 1 | 54 | 780 | 4560 | 12080 | 14316 | 6139 | 37930 | ||||||||
| 7 | 1 | 70 | 1365 | 11340 | 45780 | 92820 | 90069 | 33120 | 274565 | |||||||
| 8 | 1 | 88 | 2226 | 24920 | 142205 | 435540 | 715505 | 589448 | 190323 | 2100256 | ||||||
| 9 | 1 | 108 | 3438 | 49896 | 382515 | 1646316 | 4052503 | 5602488 | 4019580 | 1159750 | 16916595 | |||||
| 10 | 1 | 130 | 5085 | 92880 | 921585 | 5308506 | 18254320 | 37540000 | 44861859 | 28564570 | 7464270 | 143013206 | ||||
| 11 | 1 | 154 | 7260 | 163020 | 2034285 | 15130962 | 69348433 | 198102520 | 349903719 | 368725610 | 211389673 | 50563164 | 1265368801 | |||
| 12 | 1 | 180 | 10065 | 272580 | 4180935 | 39057480 | 230506738 | 873937680 | 2132907084 | 3303147760 | 3116762660 | 1627325376 | 359377681 | 11687486220 | ||
| 13 | 1 | 208 | 13611 | 437580 | 8096660 | 92908530 | 687436750 | 3345964336 | 10793361150 | 22984638820 | 31711621084 | 27119076192 | 13015078713 | 2672590508 | 112431224143 | |
| 14 | 1 | 238 | 18018 | 678496 | 14909895 | 206348142 | 1873387516 | 11407766656 | 47093970924 | 132027735840 | 249369666546 | 310417821168 | 242963186661 | 107999150798 | 20744378175 | 1124119019074 |
Compute more
?
Technical details
- Node id
n-6e2b6743fd2a183f· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-8f766a22b21a7253
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, 18, 66, 60; 4: 1, 28, 183, 396, 260; 5: 1, 40, 405, 1540, 2355, 1218; 6: 1, 54, 780, 4560, 12080, 14316, 6139; 7: 1, 70, 1365, 11340, 45780, 92820, 90069, 33120; 8: 1, 88, 2226, 24920, 142205, 435540, 715505, 589448, 190323; 9: 1, 108, 3438, 49896, 382515, 1646316, 4052503, 5602488, 4019580, 1159750;
%F FormulaThe row polynomials satisfy (n+1+(2*n-2)*x)*P(n,x) = -(n+2+(2*n^2+6*n)*x+(n^3+9*n^2+n-10)*x^2+(4*n^3+8*n^2-18*n-8)*x^3+(5*n^3-5*n^2-12*n+4)*x^4+(2*n^3-6*n^2+4*n)*x^5)*P(n-2,x) + ((n+2)*x^2+(n^2+6*n+4)*x^3+(4*n^2+8*n)*x^4+(5*n^2+n-2)*x^5+(2*n^2-2*n)*x^6)*d/dx P(n-2,x) + (2*n+3+(2*n^2+8*n)*x+(6*n^2-n-5)*x^2+(4*n^2-10*n+6)*x^3)*P(n-1,x) - ((n+1)*x^2+(3*n-1)*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 + 2 + (2*n^2 + 6*n)*x + (n^3 + 9*n^2 + n - 10)*x^2 + (4*n^3 + 8*n^2 - 18*n - 8)*x^3 + (5*n^3 - 5*n^2 - 12*n + 4)*x^4 + (2*n^3 - 6*n^2 + 4*n)*x^5)*P[n - 2, x] + ((n + 2)*x^2 + (n^2 + 6*n + 4)*x^3 + (4*n^2 + 8*n)*x^4 + (5*n^2 + n - 2)*x^5 + (2*n^2 - 2*n)*x^6)*D[P[n - 2, x], x] + (2*n + 3 + (2*n^2 + 8*n)*x + (6*n^2 - n - 5)*x^2 + (4*n^2 - 10*n + 6)*x^3)*P[n - 1, x] - ((n + 1)*x^2 + (3*n - 1)*x^3 + (2*n - 2)*x^4)*D[P[n - 1, x], x])/(n + 1 + (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 + 2 + (2*n^2 + 6*n)*x + (n^3 + 9*n^2 + n - 10)*x^2 + (4*n^3 + 8*n^2 - 18*n - 8)*x^3 + (5*n^3 - 5*n^2 - 12*n + 4)*x^4 + (2*n^3 - 6*n^2 + 4*n)*x^5)*v[i - 2] + ((n + 2)*x^2 + (n^2 + 6*n + 4)*x^3 + (4*n^2 + 8*n)*x^4 + (5*n^2 + n - 2)*x^5 + (2*n^2 - 2*n)*x^6)*deriv(v[i - 2], x) + (2*n + 3 + (2*n^2 + 8*n)*x + (6*n^2 - n - 5)*x^2 + (4*n^2 - 10*n + 6)*x^3)*v[i - 1] - ((n + 1)*x^2 + (3*n - 1)*x^3 + (2*n - 2)*x^4)*deriv(v[i - 1], x))/(n + 1 + (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 read by rows: A008277 * A007318.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: A008277 * A007318.?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
from
binomial?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
binomial?
- ↑ Liu–Wang theorem (above)
- ↑ Row-hypergeometric rows (multiplier sequences) (above)
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Riordan array (1-x,x/(1-x)).?
-
Row-hypergeometric rows (multiplier sequences) [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool RealRooted RealRooted.isPFMultiplierSequence_eval_of_roots_nonpos RealRooted RealRooted.isPFMultiplierSequence_inv_ascPochhammer RealRooted RealRooted.IsPFMultiplierSequence.mul ? step › direct check
-
from
Riordan array (1-x,x/(1-x)).?
-
Gamma criterion RealRooted IsGammaExpansion.isRealRooted_and_hasRootsNonpos_iff ? step ›
-
from
binomial?
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Gamma criterion (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
binomial?
-
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.?
-
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.?
- ↑ Liu–Wang theorem (above)
- ↑ Iterated real-rootedness preservers (above)
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
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) (above)
-
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) 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 ›
-
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.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle read by rows: A008277 * A007318.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: A008277 * A007318.?
- ↑ Ray basis map theorem (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle of numbers a(n,k), 0 <= k <= n: number of set partitions of {1,2,...,n} in which exactly k of the blocks have …?
-
Ray basis map theorem [MW08, Thm 2] polytool RealRooted rayBasisMap_maps_realRootedIn_iff ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle of numbers a(n,k), 0 <= k <= n: number of set partitions of {1,2,...,n} in which exactly k of the …?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
reversal of Triangle of numbers a(n,k), 0 <= k <= n: number of set partitions of {1,2,...,n} in which exactly k of the …?
- ↑ Iterated real-rootedness preservers (above)
-
from
Triangle of numbers a(n,k), 0 <= k <= n: number of set partitions of {1,2,...,n} in which exactly k of the blocks have …?
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
Triangle read by rows: A008277 * A007318.?
-
-
from
reversal of Triangle read by rows: A008277 * A007318.?
- ↑ Laguerre’s theorem on differential operators (above)
- ↑ Laguerre’s theorem on differential operators (above)
-
-
from
Triangle read by rows: A008277 * A007318.?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
reversal of Triangle read by rows: A008277 * A007318.?
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.