A059364 → basis A007318 → D+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 - 2\,n x - n x^{2} + 4\,n^{2} + 6\,n^{2} x + 2\,n^{2} x^{2} - 4\,n^{3} - 4\,n^{3} x - n^{3} x^{2}\right)\,P_{n-2}(x) + \left(-1 - 2\,n - 2\,n x + 4\,n^{2} + 2\,n^{2} x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 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 | 4 | 1 | 5 | |||||||||||||
| 2 | 26 | 15 | 2 | 43 | ||||||||||||
| 3 | 227 | 216 | 65 | 6 | 514 | |||||||||||
| 4 | 2463 | 3340 | 1637 | 338 | 24 | 7802 | ||||||||||
| 5 | 31818 | 56645 | 39262 | 13113 | 2074 | 120 | 143032 | |||||||||
| 6 | 476004 | 1055831 | 955942 | 449343 | 114484 | 14724 | 720 | 3067048 | ||||||||
| 7 | 8086005 | 21555576 | 24232314 | 14828148 | 5299909 | 1095076 | 118908 | 5040 | 75220976 | |||||||
| 8 | 153678285 | 479604672 | 646380330 | 489894404 | 227390589 | 65762028 | 11451068 | 1077264 | 40320 | 2075278960 | ||||||
| 9 | 3230022240 | 11568563073 | 18219404472 | 16523978918 | 9482092668 | 3554772525 | 864941804 | 130319964 | 10824336 | 362880 | 63585282880 | |||||
| 10 | 74377757790 | 300992978583 | 543259474182 | 574940167058 | 394238041238 | 182460473835 | 57471236654 | 12084663644 | 1606094856 | 119492640 | 3628800 | 2141554009280 | ||||
| 11 | 1861930845495 | 8407906762464 | 17127895593123 | 20750761156162 | 16585081471065 | 9161880105556 | 3558636064969 | 967623894642 | 179301265828 | 21330625176 | 1437798240 | 39916800 | 78623825499520 | |||
| 12 | 50343080856075 | 251089199634780 | 570265531338807 | 779090938273630 | 712191663556029 | 458161077241144 | 212216706943765 | 71093571392358 | 17020536567532 | 2821002708648 | 303897019392 | 18730500480 | 479001600 | 3124616415034240 | ||
| 13 | 1462039279662150 | 7985552395848885 | 20017566761735574 | 30467978603148783 | 31384634822370200 | 23075083495224895 | 12437586961724734 | 4965082949314145 | 1463455552505158 | 313165419433276 | 46972421165064 | 4625157021696 | 262656570240 | 6227020800 | 133624012702745600 | |
| 14 | 45387551763678600 | 269529706656681615 | 739465967772261306 | 1241513026330363665 | 1423920107360151772 | 1178996486963874713 | 725844022630495578 | 336974106659515983 | 118282707016189928 | 31143179679962760 | 6027647194926752 | 825969157870704 | 74913113038464 | 3944953877760 | 87178291200 | 6117989424431180800 |
Compute more
?
Technical details
- Node id
n-f91294e5f7553d54· revision 0 · JSON- Definition source
derived:one_plus_derivative- Fingerprint
f6-74619c273d5282fa
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: 4, 1; 2: 26, 15, 2; 3: 227, 216, 65, 6; 4: 2463, 3340, 1637, 338, 24; 5: 31818, 56645, 39262, 13113, 2074, 120; 6: 476004, 1055831, 955942, 449343, 114484, 14724, 720; 7: 8086005, 21555576, 24232314, 14828148, 5299909, 1095076, 118908, 5040; 8: 153678285, 479604672, 646380330, 489894404, 227390589, 65762028, 11451068, 1077264, 40320; 9: 3230022240, 11568563073, 18219404472, 16523978918, 9482092668, 3554772525, 864941804, 130319964, 10824336, 362880;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = -(4*n^3-4*n^2+n+(4*n^3-6*n^2+2*n)*x+(n^3-2*n^2+n)*x^2)*P(n-2,x) + (4*n^2-2*n-1+(2*n^2-2*n)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 4 + x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 4 + x;
P[n_, x_] := P[n, x] = Expand[Together[(-(4*n^3 - 4*n^2 + n + (4*n^3 - 6*n^2 + 2*n)*x + (n^3 - 2*n^2 + n)*x^2)*P[n - 2, x] + (4*n^2 - 2*n - 1 + (2*n^2 - 2*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] = 1; v[2] = 4 + x; for(n = 2, N, my(i = n + 1); v[i] = (-(4*n^3 - 4*n^2 + n + (4*n^3 - 6*n^2 + 2*n)*x + (n^3 - 2*n^2 + n)*x^2)*v[i - 2] + (4*n^2 - 2*n - 1 + (2*n^2 - 2*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_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.