A059364 → basis A013609 → (θ+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 - 8\,n x + 36\,n x^{2} + 4\,n^{2} + 24\,n^{2} x - 72\,n^{2} x^{2} - 4\,n^{3} - 16\,n^{3} x + 36\,n^{3} x^{2}\right)\,P_{n-2}(x) + \left(8\,n x^{2} + 16\,n x^{3} - 24\,n^{2} x^{2} - 32\,n^{2} x^{3} + 16\,n^{3} x^{2} + 16\,n^{3} x^{3}\right)\,P_{n-2}'(x) + \left(-1 - 2\,n - 8\,n x + 4\,n^{2} + 8\,n^{2} x\right)\,P_{n-1}(x) + \left(8\,n x^{2} - 8\,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 | 15 | 88 | 72 | 175 | ||||||||||||
| 3 | 105 | 976 | 1692 | 768 | 3541 | |||||||||||
| 4 | 945 | 12144 | 32796 | 30976 | 9600 | 86461 | ||||||||||
| 5 | 10395 | 171384 | 633996 | 923776 | 589600 | 138240 | 2467391 | |||||||||
| 6 | 135135 | 2726952 | 12869316 | 25534336 | 24985600 | 11985408 | 2257920 | 80494667 | ||||||||
| 7 | 2027025 | 48471840 | 278938728 | 703318016 | 933347600 | 683490816 | 262257408 | 41287680 | 2953139113 | |||||||
| 8 | 34459425 | 953750880 | 6486944616 | 19890663424 | 33449859600 | 33123672576 | 19343287040 | 6182535168 | 836075520 | 120301248249 | ||||||
| 9 | 654729075 | 20602345320 | 161878858344 | 585504832768 | 1194972241200 | 1496370139776 | 1179052431872 | 572232794112 | 156731314176 | 18579456000 | 5386579142643 | |||||
| 10 | 13749310575 | 485027577720 | 4326561564624 | 18051294229248 | 43391443089200 | 65838973481856 | 65494621540992 | 42816625672192 | 17776000198656 | 4260077568000 | 449622835200 | 262903997068263 | ||||
| 11 | 316234143225 | 12365573618160 | 123519781083492 | 584396397355776 | 1618516430182000 | 2888937307148544 | 3477887779149504 | 2866750291066880 | 1601023425629184 | 580786727731200 | 123744590069760 | 11771943321600 | 13890016480499325 | |||
| 12 | 7905853580625 | 339497818203600 | 3755735502467940 | 19880087260123392 | 62377775655391600 | 128159360505803520 | 181319146512256704 | 180689892557766656 | 127103125731886080 | 61957399323033600 | 19959661325058048 | 3828689519247360 | 331576403558400 | 789709853968377525 | ||
| 13 | 213458046676875 | 9988649863882200 | 121265480931544980 | 710360797026294144 | 2491828487638086000 | 5795726654194556544 | 9431034324841866688 | 11036077298986131456 | 9377611171739933184 | 5752703200276275200 | 2488090638479204352 | 720969426945441792 | 125780769476444160 | 9998303861145600 | 48071648662307483175 | |
| 14 | 6190283353629375 | 313578147280393800 | 4145983888439383020 | 26636789275688324736 | 103341311011404862800 | 268546597593209767296 | 494381577908051122240 | 664952639836243222528 | 663041713263279095808 | 490992729608898560000 | 267056212941257129984 | 103817051020658737152 | 27339498761385148416 | 4374476627871006720 | 321374052679680000 | 3119267724219700063875 |
Compute more
?
Technical details
- Node id
n-66c5ba5b8b26ed07· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-dbeaff73e6946047
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: 15, 88, 72; 3: 105, 976, 1692, 768; 4: 945, 12144, 32796, 30976, 9600; 5: 10395, 171384, 633996, 923776, 589600, 138240; 6: 135135, 2726952, 12869316, 25534336, 24985600, 11985408, 2257920; 7: 2027025, 48471840, 278938728, 703318016, 933347600, 683490816, 262257408, 41287680; 8: 34459425, 953750880, 6486944616, 19890663424, 33449859600, 33123672576, 19343287040, 6182535168, 836075520; 9: 654729075, 20602345320, 161878858344, 585504832768, 1194972241200, 1496370139776, 1179052431872, 572232794112, 156731314176, 18579456000;
%F FormulaThe row polynomials satisfy (n-1)*P(n,x) = -(4*n^3-4*n^2+n+(16*n^3-24*n^2+8*n)*x-(36*n^3-72*n^2+36*n)*x^2)*P(n-2,x) + ((16*n^3-24*n^2+8*n)*x^2+(16*n^3-32*n^2+16*n)*x^3)*d/dx P(n-2,x) + (4*n^2-2*n-1+(8*n^2-8*n)*x)*P(n-1,x) - (8*n^2-8*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[(-(4*n^3 - 4*n^2 + n + (16*n^3 - 24*n^2 + 8*n)*x - (36*n^3 - 72*n^2 + 36*n)*x^2)*P[n - 2, x] + ((16*n^3 - 24*n^2 + 8*n)*x^2 + (16*n^3 - 32*n^2 + 16*n)*x^3)*D[P[n - 2, x], x] + (4*n^2 - 2*n - 1 + (8*n^2 - 8*n)*x)*P[n - 1, x] - (8*n^2 - 8*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 + 8*x; for(n = 2, N, my(i = n + 1); v[i] = (-(4*n^3 - 4*n^2 + n + (16*n^3 - 24*n^2 + 8*n)*x - (36*n^3 - 72*n^2 + 36*n)*x^2)*v[i - 2] + ((16*n^3 - 24*n^2 + 8*n)*x^2 + (16*n^3 - 32*n^2 + 16*n)*x^3)*deriv(v[i - 2], x) + (4*n^2 - 2*n - 1 + (8*n^2 - 8*n)*x)*v[i - 1] - (8*n^2 - 8*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_A013609 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_A013609 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.