A059364 → basis A007318 → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(-1 + n\right)\,P_{n}(x) = \left(-n - 4\,n x + 9\,n x^{2} + 4\,n^{2} + 12\,n^{2} x - 18\,n^{2} x^{2} - 4\,n^{3} - 8\,n^{3} x + 9\,n^{3} x^{2}\right)\,P_{n-2}(x) + \left(4\,n x^{2} + 4\,n x^{3} - 12\,n^{2} x^{2} - 8\,n^{2} x^{3} + 8\,n^{3} x^{2} + 4\,n^{3} x^{3}\right)\,P_{n-2}'(x) + \left(-1 - 2\,n - 4\,n x + 4\,n^{2} + 4\,n^{2} x\right)\,P_{n-1}(x) + \left(4\,n x^{2} - 4\,n^{2} x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 3 + 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 | 3 | 4 | 7 | |||||||||||||
| 2 | 15 | 44 | 18 | 77 | ||||||||||||
| 3 | 105 | 488 | 423 | 96 | 1112 | |||||||||||
| 4 | 945 | 6072 | 8199 | 3872 | 600 | 19688 | ||||||||||
| 5 | 10395 | 85692 | 158499 | 115472 | 36850 | 4320 | 411228 | |||||||||
| 6 | 135135 | 1363476 | 3217329 | 3191792 | 1561600 | 374544 | 35280 | 9879156 | ||||||||
| 7 | 2027025 | 24235920 | 69734682 | 87914752 | 58334225 | 21359088 | 4097772 | 322560 | 268026024 | |||||||
| 8 | 34459425 | 476875440 | 1621736154 | 2486332928 | 2090616225 | 1035114768 | 302238860 | 48301056 | 3265920 | 8098940776 | ||||||
| 9 | 654729075 | 10301172660 | 40469714586 | 73188104096 | 74685765075 | 46761566868 | 18422694248 | 4470568704 | 612231696 | 36288000 | 269602835008 | |||||
| 10 | 13749310575 | 242513788860 | 1081640391156 | 2256411778656 | 2711965193075 | 2057467921308 | 1023353461578 | 334504888064 | 69437500776 | 8320464000 | 439084800 | 9799803782848 | ||||
| 11 | 316234143225 | 6182786809080 | 30879945270873 | 73049549669472 | 101157276886375 | 90279290848392 | 54341996549211 | 22396486648960 | 6253997756364 | 1134349077600 | 120844326240 | 5748019200 | 386118506004992 | |||
| 12 | 7905853580625 | 169748909101800 | 938933875616985 | 2485010907515424 | 3898610978461975 | 4004980015806360 | 2833111664254011 | 1411639785607552 | 496496584890180 | 121010545552800 | 19491856762752 | 1869477304320 | 80951270400 | 16388891405725184 | ||
| 13 | 213458046676875 | 4994324931941100 | 30316370232886245 | 88795099628286768 | 155739280477380375 | 181116457943579892 | 147359911325654167 | 86219353898329152 | 36631293639609114 | 11235748438039600 | 2429776014139848 | 352035853000704 | 30708195672960 | 1220496076800 | 745435039121273600 | |
| 14 | 6190283353629375 | 156789073640196900 | 1036495972109845755 | 3329598659461040592 | 6458831938212803925 | 8392081174787805228 | 7724712154813298785 | 5194942498720650176 | 2590006692434683968 | 958970175017380000 | 260797082950446416 | 50691919443681024 | 6674682314791296 | 533993728988160 | 19615115520000 | 36167335916104761600 |
Compute more
?
Technical details
- Node id
n-e7607fd6407e2cb6· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-1489a2b47feb22bc
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, 4; 2: 15, 44, 18; 3: 105, 488, 423, 96; 4: 945, 6072, 8199, 3872, 600; 5: 10395, 85692, 158499, 115472, 36850, 4320; 6: 135135, 1363476, 3217329, 3191792, 1561600, 374544, 35280; 7: 2027025, 24235920, 69734682, 87914752, 58334225, 21359088, 4097772, 322560; 8: 34459425, 476875440, 1621736154, 2486332928, 2090616225, 1035114768, 302238860, 48301056, 3265920; 9: 654729075, 10301172660, 40469714586, 73188104096, 74685765075, 46761566868, 18422694248, 4470568704, 612231696, 36288000;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = -(4*n^3-4*n^2+n+(8*n^3-12*n^2+4*n)*x-(9*n^3-18*n^2+9*n)*x^2)*P(n-2,x) + ((8*n^3-12*n^2+4*n)*x^2+(4*n^3-8*n^2+4*n)*x^3)*d/dx P(n-2,x) + (4*n^2-2*n-1+(4*n^2-4*n)*x)*P(n-1,x) - (4*n^2-4*n)*x^2*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 4*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 3 + 4*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(4*n^3 - 4*n^2 + n + (8*n^3 - 12*n^2 + 4*n)*x - (9*n^3 - 18*n^2 + 9*n)*x^2)*P[n - 2, x] + ((8*n^3 - 12*n^2 + 4*n)*x^2 + (4*n^3 - 8*n^2 + 4*n)*x^3)*D[P[n - 2, x], x] + (4*n^2 - 2*n - 1 + (4*n^2 - 4*n)*x)*P[n - 1, x] - (4*n^2 - 4*n)*x^2*D[P[n - 1, x], x])/(n - 1)]];
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 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = (-(4*n^3 - 4*n^2 + n + (8*n^3 - 12*n^2 + 4*n)*x - (9*n^3 - 18*n^2 + 9*n)*x^2)*v[i - 2] + ((8*n^3 - 12*n^2 + 4*n)*x^2 + (4*n^3 - 8*n^2 + 4*n)*x^3)*deriv(v[i - 2], x) + (4*n^2 - 2*n - 1 + (4*n^2 - 4*n)*x)*v[i - 1] - (4*n^2 - 4*n)*x^2*deriv(v[i - 1], x))/(n - 1)); 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
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
basis_map_A007318 of Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Liu–Wang theorem (above)
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
- ↑ Parent-row provers of polytool (above)
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, giving coefficients of the polynomial (x+1)(x+2)...(x+n), expanded in incre…?
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Parent-row provers of polytool (above)
-
from
Triangle read by rows: T(n,k) = |s(n,n+1-k)|, where s(n,k) are the signed Stirling numbers of the first kind A008276 (1…?
-
Geometric basis map (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
- ↑ Liu–Wang theorem (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
- ↑ Liu–Wang theorem (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
-
-
from
basis_map_A007318 of Triangle T(n,k)=Sum_{i=0..n} |stirling1(n,n-i)|*binomial(i,k), k=0..n-1.?
References
- [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
- [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.