A130850 → (θ+1)²
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(1 - 7\,x^{2} + 4\,n x - 2\,n x^{2} - n^{2} - 4\,n^{2} x + 9\,n^{2} x^{2}\right)\,P_{n-2}(x) + \left(-x - 8\,x^{2} - 13\,x^{3} + 2\,n x - 14\,n x^{3} + 4\,n^{2} x^{2} + 4\,n^{2} x^{3}\right)\,P_{n-2}'(x) + \left(-x^{2} - 4\,x^{3} - 3\,x^{4} - 4\,n x^{3} - 4\,n x^{4}\right)\,P_{n-2}''(x) + \left(1 + 2\,n + 4\,n x\right)\,P_{n-1}(x) + \left(-2\,x - 4\,x^{2} - 4\,n x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 1 + 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 | 1 | 4 | 5 | |||||||||||||
| 2 | 2 | 12 | 9 | 23 | ||||||||||||
| 3 | 6 | 48 | 63 | 16 | 133 | |||||||||||
| 4 | 24 | 240 | 450 | 240 | 25 | 979 | ||||||||||
| 5 | 120 | 1440 | 3510 | 2880 | 775 | 36 | 8761 | |||||||||
| 6 | 720 | 10080 | 30240 | 33600 | 15050 | 2268 | 49 | 92007 | ||||||||
| 7 | 5040 | 80640 | 287280 | 403200 | 255150 | 69552 | 6223 | 64 | 1107149 | |||||||
| 8 | 40320 | 725760 | 2993760 | 5080320 | 4170600 | 1678320 | 296450 | 16320 | 81 | 15001931 | ||||||
| 9 | 362880 | 7257600 | 34020000 | 67737600 | 68481000 | 36741600 | 10026870 | 1194240 | 41391 | 100 | 225863281 | |||||
| 10 | 3628800 | 79833600 | 419126400 | 958003200 | 1151766000 | 775383840 | 290154480 | 55968000 | 4617162 | 102300 | 121 | 3738583903 | ||||
| 11 | 39916800 | 958003200 | 5568393600 | 14370048000 | 20037402000 | 16262104320 | 7783073760 | 2118758400 | 297189486 | 17305200 | 247687 | 144 | 67452442597 | |||
| 12 | 479001600 | 12454041600 | 79394515200 | 228324096000 | 362378016000 | 344665601280 | 201640158720 | 71587676160 | 14596525944 | 1519518000 | 63313250 | 589680 | 169 | 1317103053603 | ||
| 13 | 6227020800 | 174356582400 | 1209598790400 | 3835844812800 | 6828966144000 | 7453743897600 | 5164506547200 | 2273093222400 | 616601545560 | 96180084000 | 7544406870 | 227223360 | 1384279 | 196 | 27666891661865 | |
| 14 | 87178291200 | 2615348736000 | 19615115520000 | 67999067136000 | 134218244160000 | 165420807552000 | 132624415123200 | 69875476070400 | 23837794540560 | 5048319276000 | 612067135680 | 36595540800 | 802784138 | 3211068 | 225 | 621991235077271 |
Compute more
?
Technical details
- Node id
n-5ce84951924c70ee· revision 0 · JSON- Definition source
derived:theta_plus_one_squared- Fingerprint
f6-61423eae1de6db11
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: 1, 4; 2: 2, 12, 9; 3: 6, 48, 63, 16; 4: 24, 240, 450, 240, 25; 5: 120, 1440, 3510, 2880, 775, 36; 6: 720, 10080, 30240, 33600, 15050, 2268, 49; 7: 5040, 80640, 287280, 403200, 255150, 69552, 6223, 64; 8: 40320, 725760, 2993760, 5080320, 4170600, 1678320, 296450, 16320, 81; 9: 362880, 7257600, 34020000, 67737600, 68481000, 36741600, 10026870, 1194240, 41391, 100;
%F FormulaThe row polynomials satisfy P(n,x) = -(n^2-1+(4*n^2-4*n)*x-(9*n^2-2*n-7)*x^2)*P(n-2,x) + ((2*n-1)*x+(4*n^2-8)*x^2+(4*n^2-14*n-13)*x^3)*d/dx P(n-2,x) - (x^2+(4*n+4)*x^3+(4*n+3)*x^4)*d^2/dx^2 P(n-2,x) + (2*n+1+4*n*x)*P(n-1,x) - (2*x+(4*n+4)*x^2)*d/dx P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 1 + 4*x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 1 + 4*x;
P[n_, x_] := P[n, x] = Expand[-(n^2 - 1 + (4*n^2 - 4*n)*x - (9*n^2 - 2*n - 7)*x^2)*P[n - 2, x] + ((2*n - 1)*x + (4*n^2 - 8)*x^2 + (4*n^2 - 14*n - 13)*x^3)*D[P[n - 2, x], x] - (x^2 + (4*n + 4)*x^3 + (4*n + 3)*x^4)*D[P[n - 2, x], {x, 2}] + (2*n + 1 + 4*n*x)*P[n - 1, x] - (2*x + (4*n + 4)*x^2)*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 1 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = -(n^2 - 1 + (4*n^2 - 4*n)*x - (9*n^2 - 2*n - 7)*x^2)*v[i - 2] + ((2*n - 1)*x + (4*n^2 - 8)*x^2 + (4*n^2 - 14*n - 13)*x^3)*deriv(v[i - 2], x) - (x^2 + (4*n + 4)*x^3 + (4*n + 3)*x^4)*deriv(deriv(v[i - 2], x), x) + (2*n + 1 + 4*n*x)*v[i - 1] - (2*x + (4*n + 4)*x^2)*deriv(v[i - 1], x)); 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
Proof chains ? JSON
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle read by rows, 0 <= k <= n, T(n,k) = Sum_{j=0..n} A(n,j)*binomial(n-j,k) where A(n,j) are the Eulerian numbers …?
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
from
Triangular array a(n,k) = (1/k)*Sum_{i=0..k} (-1)^(k-i)*binomial(k,i)*i^n; n >= 1, 1 <= k <= n, read by rows.?
-
Ma–Wang interval theorem [MW08, Thm 2, Cor 3] RealRooted RealRooted.affineEndpointStep_closed ? step › direct check
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
-
-
from
Triangular array a(n,k) = (1/k)*Sum_{i=0..k} (-1)^(k-i)*binomial(k,i)*i^n; n >= 1, 1 <= k <= n, read by rows.?
- ↑ Iterated real-rootedness preservers (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
- ↑ Affine, reversal and Möbius substitutions (elementary) (above)
-
-
from
Triangle read by rows, 0 <= k <= n, T(n,k) = Sum_{j=0..n} A(n,j)*binomial(n-j,k) where A(n,j) are the Eulerian numbers …?
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
- [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.