A145324 → basis A013610 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(\left(n\right)\,P_{n}(x) = \left(-1 - 3\,n - 6\,n x - 3\,n^{2} - 12\,n^{2} x - 9\,n^{2} x^{2} - n^{3} - 6\,n^{3} x - 9\,n^{3} x^{2}\right)\,P_{n-2}(x) + \left(1 + 4\,n + 6\,n x + 2\,n^{2} + 6\,n^{2} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 3 + 12\,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 | 12 | 15 | |||||||||||||
| 2 | 12 | 102 | 162 | 276 | ||||||||||||
| 3 | 60 | 798 | 2646 | 2592 | 6096 | |||||||||||
| 4 | 360 | 6588 | 33831 | 68472 | 48600 | 157851 | ||||||||||
| 5 | 2520 | 59076 | 414693 | 1291248 | 1880820 | 1049760 | 4698117 | |||||||||
| 6 | 20160 | 578448 | 5178438 | 21941388 | 48941820 | 55794744 | 25719120 | 158174118 | ||||||||
| 7 | 181440 | 6173712 | 67430070 | 363182508 | 1098718020 | 1911677112 | 1793724912 | 705438720 | 5946526494 | |||||||
| 8 | 1814400 | 71534880 | 924336036 | 6059307600 | 23244589845 | 54715234968 | 78155078148 | 62403613056 | 21427701120 | 247003210053 | ||||||
| 9 | 19958400 | 895747680 | 13386765996 | 103625825040 | 482914523295 | 1438672819068 | 2774739083508 | 3366042422976 | 2341826652960 | 714256704000 | 11236380502923 | |||||
| 10 | 239500800 | 12066226560 | 204980702112 | 1832527604304 | 10069539562440 | 36387488951298 | 88685772536214 | 145039811653728 | 153066244788504 | 94438057723200 | 25927518355200 | 555664247604360 | ||||
| 11 | 3113510400 | 174105002880 | 3316325361696 | 33661932557328 | 213367756505400 | 908041465464282 | 2681189578925298 | 5534303621559840 | 7863973554226536 | 7350344541941760 | 4076804824456320 | 1018244357222400 | 29683425176734140 | |||
| 12 | 43589145600 | 2680323851520 | 56613697732224 | 643715974610784 | 4628167803245340 | 22698191520952668 | 78852540783579003 | 196984700505365328 | 352913201155109484 | 443677010937001200 | 372405048391689984 | 187704935350709760 | 43020824092646400 | 1703587674125639295 | ||
| 13 | 653837184000 | 43866346003200 | 1018065868629120 | 12826106692166304 | 103217605715746260 | 573732530097855156 | 2294999496280365777 | 6739692465192272064 | 14601225116205154008 | 23124437884626793920 | 26083953631164805200 | 19878496247479896576 | 9185886919846990080 | 1945864966652006400 | 104545395556005868065 | |
| 14 | 10461394944000 | 760706882611200 | 19250032253281920 | 266301659192408064 | 2372950192886294760 | 14753471190215980536 | 66840949770623248122 | 225863624966066592984 | 574816532909641237368 | 1100052261964286403120 | 1562002933387663182240 | 1598540936398677873216 | 1116050882782196799360 | 476296051735940083200 | 93818489463578880000 | 6831695407621499820090 |
Compute more
?
Technical details
- Node id
n-a9896c2cd46e63b5· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-677b43bbbe9b90a7
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, 12; 2: 12, 102, 162; 3: 60, 798, 2646, 2592; 4: 360, 6588, 33831, 68472, 48600; 5: 2520, 59076, 414693, 1291248, 1880820, 1049760; 6: 20160, 578448, 5178438, 21941388, 48941820, 55794744, 25719120; 7: 181440, 6173712, 67430070, 363182508, 1098718020, 1911677112, 1793724912, 705438720; 8: 1814400, 71534880, 924336036, 6059307600, 23244589845, 54715234968, 78155078148, 62403613056, 21427701120; 9: 19958400, 895747680, 13386765996, 103625825040, 482914523295, 1438672819068, 2774739083508, 3366042422976, 2341826652960, 714256704000;
%F FormulaThe row polynomials satisfy n*P(n,x) = -(n^3+3*n^2+3*n+1+(6*n^3+12*n^2+6*n)*x+(9*n^3+9*n^2)*x^2)*P(n-2,x) + (2*n^2+4*n+1+(6*n^2+6*n)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 12*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 3 + 12*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^3 + 3*n^2 + 3*n + 1 + (6*n^3 + 12*n^2 + 6*n)*x + (9*n^3 + 9*n^2)*x^2)*P[n - 2, x] + (2*n^2 + 4*n + 1 + (6*n^2 + 6*n)*x)*P[n - 1, x])/(n)]];
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 + 12*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n^3 + 3*n^2 + 3*n + 1 + (6*n^3 + 12*n^2 + 6*n)*x + (9*n^3 + 9*n^2)*x^2)*v[i - 2] + (2*n^2 + 4*n + 1 + (6*n^2 + 6*n)*x)*v[i - 1])/(n)); 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_A013610 of Triangle read by rows: coefficients of 1; 1(X+2); 1(X+2)(X+3); 1(X+2)(X+3)(X+4); ....?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: coefficients of 1; 1(X+2); 1(X+2)(X+3); 1(X+2)(X+3)(X+4); ....?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: T(n,k) = (-1)^(n+k)*Sum_{j=1..k} s(n,j), where s(n,j) are the signed Stirling numbers of the fir…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: coefficients of 1; 1(X+2); 1(X+2)(X+3); 1(X+2)(X+3)(X+4); ....?
- ↑ Liu–Wang theorem (above)
-
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…?
-
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…?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangle read by rows: coefficients of 1; 1(X+2); 1(X+2)(X+3); 1(X+2)(X+3)(X+4); ....?
-
Geometric basis map (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…?
- ↑ Liu–Wang theorem (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ 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…?
-
Geometric basis map (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…?
- ↑ Liu–Wang theorem (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ 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…?
-
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…?
- ↑ Liu–Wang theorem (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ 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…?
-
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…?
- ↑ Liu–Wang theorem (above)
- ↑ Geometric basis map (elementary) (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ 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…?
-
from
Triangle read by rows: T(n,k) = (-1)^(n+k)*Sum_{j=1..k} s(n,j), where s(n,j) are the signed Stirling numbers of the fir…?
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: coefficients of 1; 1(X+2); 1(X+2)(X+3); 1(X+2)(X+3)(X+4); ....?
-
Geometric basis map (elementary) polytool ? step ›
-
from
Triangle read by rows: coefficients of 1; 1(X+2); 1(X+2)(X+3); 1(X+2)(X+3)(X+4); ....?
- ↑ Liu–Wang theorem (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Parent-row provers of polytool (above)
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
from
Triangle read by rows: coefficients of 1; 1(X+2); 1(X+2)(X+3); 1(X+2)(X+3)(X+4); ....?
-
-
from
basis_map_A013610 of Triangle read by rows: coefficients of 1; 1(X+2); 1(X+2)(X+3); 1(X+2)(X+3)(X+4); ....?
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.