A122542 → θ+1 → θ+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(x^{3}\right)\,P_{n-6}(x) + \left(3\,x^{2} + 3\,x^{3}\right)\,P_{n-5}(x) + \left(3\,x + 3\,x^{2} + 3\,x^{3}\right)\,P_{n-4}(x) + \left(1 - 3\,x - 3\,x^{2} + x^{3}\right)\,P_{n-3}(x) + \left(-3 - 3\,x - 3\,x^{2}\right)\,P_{n-2}(x) + \left(3 + 3\,x\right)\,P_{n-1}(x)\)
\(P_{1}(x) = 1\)
\(P_{2}(x) = 4\,x\)
\(P_{3}(x) = 8\,x + 9\,x^{2}\)
\(P_{4}(x) = 8\,x + 36\,x^{2} + 16\,x^{3}\)
\(P_{5}(x) = 8\,x + 72\,x^{2} + 96\,x^{3} + 25\,x^{4}\)
\(P_{6}(x) = 8\,x + 108\,x^{2} + 288\,x^{3} + 200\,x^{4} + 36\,x^{5}\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | |||||||
| 2 | 0 | 4 | 4 | ||||||
| 3 | 0 | 8 | 9 | 17 | |||||
| 4 | 0 | 8 | 36 | 16 | 60 | ||||
| 5 | 0 | 8 | 72 | 96 | 25 | 201 | |||
| 6 | 0 | 8 | 108 | 288 | 200 | 36 | 640 | ||
| 7 | 0 | 8 | 144 | 608 | 800 | 360 | 49 | 1969 | |
| 8 | 0 | 8 | 180 | 1056 | 2200 | 1800 | 588 | 64 | 5896 |
Compute more
?
Technical details
- Node id
n-4a50fdcc7daea3bc· revision 0 · JSON- Definition source
derived:theta_plus_one- Fingerprint
f6-7ce493974858d62c
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 -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 = 1, …, ascending powers of x
%e ExampleTriangle begins: 1: 1; 2: 0, 4; 3: 0, 8, 9; 4: 0, 8, 36, 16; 5: 0, 8, 72, 96, 25; 6: 0, 8, 108, 288, 200, 36; 7: 0, 8, 144, 608, 800, 360, 49; 8: 0, 8, 180, 1056, 2200, 1800, 588, 64; 9: 0, 8, 216, 1632, 4800, 6120, 3528, 896, 81; 10: 0, 8, 252, 2336, 9000, 16200, 14308, 6272, 1296, 100;
%F FormulaThe row polynomials satisfy P(n,x) = x^3*P(n-6,x) + (3*x^2+3*x^3)*P(n-5,x) + (3*x+3*x^2+3*x^3)*P(n-4,x) + (1-3*x-3*x^2+x^3)*P(n-3,x) - (3+3*x+3*x^2)*P(n-2,x) + (3+3*x)*P(n-1,x) for n >= 7, with P(1,x) = 1, P(2,x) = 4*x, P(3,x) = 8*x + 9*x^2, P(4,x) = 8*x + 36*x^2 + 16*x^3, P(5,x) = 8*x + 72*x^2 + 96*x^3 + 25*x^4, P(6,x) = 8*x + 108*x^2 + 288*x^3 + 200*x^4 + 36*x^5.
%t MathematicaP[1, x_] := 1;
P[2, x_] := 4*x;
P[3, x_] := 8*x + 9*x^2;
P[4, x_] := 8*x + 36*x^2 + 16*x^3;
P[5, x_] := 8*x + 72*x^2 + 96*x^3 + 25*x^4;
P[6, x_] := 8*x + 108*x^2 + 288*x^3 + 200*x^4 + 36*x^5;
P[n_, x_] := P[n, x] = Expand[x^3*P[n - 6, x] + (3*x^2 + 3*x^3)*P[n - 5, x] + (3*x + 3*x^2 + 3*x^3)*P[n - 4, x] + (1 - 3*x - 3*x^2 + x^3)*P[n - 3, x] - (3 + 3*x + 3*x^2)*P[n - 2, x] + (3 + 3*x)*P[n - 1, x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; v[2] = 4*x; v[3] = 8*x + 9*x^2; v[4] = 8*x + 36*x^2 + 16*x^3; v[5] = 8*x + 72*x^2 + 96*x^3 + 25*x^4; v[6] = 8*x + 108*x^2 + 288*x^3 + 200*x^4 + 36*x^5; for(n = 7, N, my(i = n); v[i] = x^3*v[i - 6] + (3*x^2 + 3*x^3)*v[i - 5] + (3*x + 3*x^2 + 3*x^3)*v[i - 4] + (1 - 3*x - 3*x^2 + x^3)*v[i - 3] - (3 + 3*x + 3*x^2)*v[i - 2] + (3 + 3*x)*v[i - 1]); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, 0]
-
Coefficients of one sign?
Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
derived from Laguerre’s theorem on multiplier sequences
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 1, 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
theta_plus_one of Triangle T(n,k), 0 <= k <= n, read by rows, given by [0, 2, -1, 0, 0, 0, 0, 0, ...] DELTA [1, 0, 0, 0…?
-
Laguerre’s theorem on multiplier sequences [SP14; Bra15, Thm 7.1 of arXiv:1410.6601] polytool ? step ›
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, given by [0, 2, -1, 0, 0, 0, 0, 0, ...] DELTA [1, 0, 0, 0, 0, 0, 0, 0, ...]…?
-
Liu–Wang theorem with a lag row [LW07, Thm 2.1] RealRooted ? step › direct check
-
from
Triangle T(n,k), 0 <= k <= n, read by rows, given by [0, 2, -1, 0, 0, 0, 0, 0, ...] DELTA [1, 0, 0, 0, 0, 0, 0, 0, ...]…?
-
-
from
theta_plus_one of Triangle T(n,k), 0 <= k <= n, read by rows, given by [0, 2, -1, 0, 0, 0, 0, 0, ...] DELTA [1, 0, 0, 0…?
Related ?
Candidate equalities ?
- A122542 → (θ+1)² 15 rows; no all-index equality certificate was found
References
- [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.