A145324 → basis A007318 → (θ+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 - 4\,n x - 3\,n^{2} - 8\,n^{2} x + 9\,n^{2} x^{2} - n^{3} - 4\,n^{3} x + 9\,n^{3} x^{2}\right)\,P_{n-2}(x) + \left(4\,n x^{2} + 8\,n^{2} x^{2} + 4\,n^{2} x^{3} + 4\,n^{3} x^{2} + 4\,n^{3} x^{3}\right)\,P_{n-2}'(x) + \left(1 + 4\,n + 4\,n x + 2\,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 + 8\,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 | 8 | 11 | |||||||||||||
| 2 | 12 | 68 | 54 | 134 | ||||||||||||
| 3 | 60 | 532 | 882 | 384 | 1858 | |||||||||||
| 4 | 360 | 4392 | 11277 | 10144 | 3000 | 29173 | ||||||||||
| 5 | 2520 | 39384 | 138231 | 191296 | 116100 | 25920 | 513451 | |||||||||
| 6 | 20160 | 385632 | 1726146 | 3250576 | 3021100 | 1377648 | 246960 | 10028222 | ||||||||
| 7 | 181440 | 4115808 | 22476690 | 53804816 | 67822100 | 47201904 | 17223696 | 2580480 | 215406934 | |||||||
| 8 | 1814400 | 47689920 | 308112012 | 897675200 | 1434851225 | 1350993456 | 750460284 | 228271104 | 29393280 | 5049260881 | ||||||
| 9 | 19958400 | 597165120 | 4462255332 | 15351974080 | 29809538475 | 35522785656 | 26643585164 | 12312912384 | 3212382240 | 362880000 | 128295436851 | |||||
| 10 | 239500800 | 8044151040 | 68326900704 | 271485571008 | 621576516200 | 898456517316 | 851578062762 | 530552580352 | 209967413976 | 47979504000 | 4829932800 | 3513036650958 | ||||
| 11 | 3113510400 | 116070001920 | 1105441787232 | 4986952971456 | 13170849167000 | 22420776925044 | 25745304598734 | 20244366242560 | 10787343695784 | 3734361907200 | 759451524480 | 68976230400 | 103143008562210 | |||
| 12 | 43589145600 | 1786882567680 | 18871232577408 | 95365329571968 | 285689370570700 | 560449173356856 | 757157456083749 | 720565891194752 | 484105900075596 | 225411274164000 | 69373834142976 | 12715198248960 | 1052366515200 | 3232587498215445 | ||
| 13 | 653837184000 | 29244230668800 | 339355289543040 | 1900163954395008 | 6371457142947300 | 14166235311058152 | 22037032200222991 | 24653653279166976 | 20029115385740952 | 11748431582902400 | 4859074496482800 | 1346576317802496 | 224703268957440 | 17086945075200 | 107722783242147555 | |
| 14 | 10461394944000 | 507137921740800 | 6416677417760640 | 39452097658134528 | 146478406968289800 | 364283239264592112 | 641819819471005126 | 826204389450632256 | 788500045143540792 | 558884449506826400 | 290979225173403360 | 108285724493127936 | 27300606231300480 | 4182430237977600 | 294226732800000 | 3803598937066075830 |
Compute more
?
Technical details
- Node id
n-3cd852da1a767dd6· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-6449e3f2a5084b2d
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, 8; 2: 12, 68, 54; 3: 60, 532, 882, 384; 4: 360, 4392, 11277, 10144, 3000; 5: 2520, 39384, 138231, 191296, 116100, 25920; 6: 20160, 385632, 1726146, 3250576, 3021100, 1377648, 246960; 7: 181440, 4115808, 22476690, 53804816, 67822100, 47201904, 17223696, 2580480; 8: 1814400, 47689920, 308112012, 897675200, 1434851225, 1350993456, 750460284, 228271104, 29393280; 9: 19958400, 597165120, 4462255332, 15351974080, 29809538475, 35522785656, 26643585164, 12312912384, 3212382240, 362880000;
%F FormulaThe row polynomials satisfy n*P(n,x) = -(n^3+3*n^2+3*n+1+(4*n^3+8*n^2+4*n)*x-(9*n^3+9*n^2)*x^2)*P(n-2,x) + ((4*n^3+8*n^2+4*n)*x^2+(4*n^3+4*n^2)*x^3)*d/dx P(n-2,x) + (2*n^2+4*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 + 8*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 3 + 8*x;
P[n_, x_] := P[n, x] = Expand[Together[(-(n^3 + 3*n^2 + 3*n + 1 + (4*n^3 + 8*n^2 + 4*n)*x - (9*n^3 + 9*n^2)*x^2)*P[n - 2, x] + ((4*n^3 + 8*n^2 + 4*n)*x^2 + (4*n^3 + 4*n^2)*x^3)*D[P[n - 2, x], x] + (2*n^2 + 4*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)]];
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 + 8*x; for(n = 2, N, my(i = n + 1); v[i] = (-(n^3 + 3*n^2 + 3*n + 1 + (4*n^3 + 8*n^2 + 4*n)*x - (9*n^3 + 9*n^2)*x^2)*v[i - 2] + ((4*n^3 + 8*n^2 + 4*n)*x^2 + (4*n^3 + 4*n^2)*x^3)*deriv(v[i - 2], x) + (2*n^2 + 4*n + 1 + (4*n^2 + 4*n)*x)*v[i - 1] - (4*n^2 + 4*n)*x^2*deriv(v[i - 1], x))/(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_A007318 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); ....?
-
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) (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_A007318 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.