A059364 → basis A013610 → D
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 - 6\,n x - 9\,n x^{2} + 4\,n^{2} + 18\,n^{2} x + 18\,n^{2} x^{2} - 4\,n^{3} - 12\,n^{3} x - 9\,n^{3} x^{2}\right)\,P_{n-2}(x) + \left(-1 - 2\,n - 6\,n x + 4\,n^{2} + 6\,n^{2} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 3\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | x8 | x9 | x10 | x11 | x12 | x13 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 0 | ||||||||||||||
| 1 | 3 | 3 | |||||||||||||
| 2 | 33 | 36 | 69 | ||||||||||||
| 3 | 366 | 846 | 486 | 1698 | |||||||||||
| 4 | 4554 | 16398 | 19602 | 7776 | 48330 | ||||||||||
| 5 | 64269 | 316998 | 584577 | 477576 | 145800 | 1589220 | |||||||||
| 6 | 1022607 | 6434658 | 16158447 | 20238336 | 12640860 | 3149280 | 59644188 | ||||||||
| 7 | 18176940 | 139469364 | 445068432 | 756011556 | 720869220 | 365788872 | 77157360 | 2522541744 | |||||||
| 8 | 357656580 | 3243472308 | 12587060448 | 27094386276 | 34935123420 | 26979444360 | 11553763536 | 2116316160 | 118867223088 | ||||||
| 9 | 7725879495 | 80939429172 | 370514776986 | 967927515372 | 1578202881795 | 1644507441648 | 1069374004524 | 396726139008 | 64283103360 | 6180201171360 | |||||
| 10 | 181885341645 | 2163280782312 | 11423084629446 | 35147068902252 | 69439542344145 | 91349960019228 | 80014614552684 | 44995500502848 | 14739452362080 | 2142770112000 | 351597159548640 | ||||
| 11 | 4637090106810 | 61759890541746 | 369813345201702 | 1310998308447420 | 3046926066133230 | 4850854957270386 | 5357309595452010 | 4052590546123872 | 2009465360496072 | 589730299185600 | 77782555065600 | 21731868014024448 | |||
| 12 | 127311681826350 | 1877867751233970 | 12580367719296834 | 50525998280867196 | 135168075533464650 | 252898579988715186 | 337668648091656462 | 321729787008836640 | 214366551130418616 | 95121871899482880 | 25297883724389760 | 3054733071667200 | 1450417675881855744 | ||
| 13 | 3745743698955825 | 60632740465772490 | 449525191868201763 | 2018381074986849660 | 6112680455595821355 | 13154127594661455642 | 20623938887961265437 | 23737078278466705872 | 19903791285534010212 | 11857507756937511120 | 4763771165046339072 | 1158787755027233280 | 129062472277939200 | 103973030402528060928 | |
| 14 | 117591805230147675 | 2072991944219691510 | 16856093213521517997 | 83706461919237938868 | 283232739649088426445 | 689548795207211609910 | 1242646479889288024131 | 1678324336697675211264 | 1698786895938038148600 | 1272711318276108299040 | 685966222156856846832 | 251872178276094755328 | 56467654549799351040 | 5837594899956019200 | 7968147354422325987840 |
Compute more
?
Technical details
- Node id
n-967d4341ec1a993c· revision 0 · JSON- Definition source
derived:derivative- Fingerprint
f6-a733e5459162abd5
Observed on the stored rows ?
- Degrees: -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (affine: slope 1, intercept -1)
- 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: 0; 1: 3; 2: 33, 36; 3: 366, 846, 486; 4: 4554, 16398, 19602, 7776; 5: 64269, 316998, 584577, 477576, 145800; 6: 1022607, 6434658, 16158447, 20238336, 12640860, 3149280; 7: 18176940, 139469364, 445068432, 756011556, 720869220, 365788872, 77157360; 8: 357656580, 3243472308, 12587060448, 27094386276, 34935123420, 26979444360, 11553763536, 2116316160; 9: 7725879495, 80939429172, 370514776986, 967927515372, 1578202881795, 1644507441648, 1069374004524, 396726139008, 64283103360;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = -(4*n^3-4*n^2+n+(12*n^3-18*n^2+6*n)*x+(9*n^3-18*n^2+9*n)*x^2)*P(n-2,x) + (4*n^2-2*n-1+(6*n^2-6*n)*x)*P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 3.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 3;
P[n_, x_] := P[n, x] = Expand[Together[(-(4*n^3 - 4*n^2 + n + (12*n^3 - 18*n^2 + 6*n)*x + (9*n^3 - 18*n^2 + 9*n)*x^2)*P[n - 2, x] + (4*n^2 - 2*n - 1 + (6*n^2 - 6*n)*x)*P[n - 1, x])/(n - 1)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 3; for(n = 2, N, my(i = n + 1); v[i] = (-(4*n^3 - 4*n^2 + n + (12*n^3 - 18*n^2 + 6*n)*x + (9*n^3 - 18*n^2 + 9*n)*x^2)*v[i - 2] + (4*n^2 - 2*n - 1 + (6*n^2 - 6*n)*x)*v[i - 1])/(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 differential operators
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Laguerre’s theorem on differential operators
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
-
Laguerre’s theorem on differential operators [SP14] polytool ? step ›
-
from
basis_map_A013610 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.?
-
-
from
basis_map_A013610 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.