A026386 → basis A013611
nonnegative coefficients
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-2 + n\right)\,P_{n}(x) = \left(-10 - 40\,x - 32\,x^{2} + 5\,n + 20\,n x + 16\,n x^{2}\right)\,P_{n-2}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 2 + 4\,x\)
\(P_{2}(x) = 4 + 16\,x + 16\,x^{2}\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 2 | 4 | 6 | ||||||
| 2 | 4 | 16 | 16 | 36 | |||||
| 3 | 10 | 60 | 112 | 64 | 246 | ||||
| 4 | 20 | 160 | 464 | 576 | 256 | 1476 | |||
| 5 | 50 | 500 | 1920 | 3520 | 3072 | 1024 | 10086 | ||
| 6 | 100 | 1200 | 5840 | 14720 | 20224 | 14336 | 4096 | 60516 | |
| 7 | 250 | 3500 | 20400 | 64000 | 116480 | 122880 | 69632 | 16384 | 413526 |
Compute more
?
Technical details
- Node id
n-86d3a319b89ca52d· revision 0 · JSON- Definition source
derived:basis_map_A013611- Fingerprint
f6-f1a71cb20d3cb9c5
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: 2, 4; 2: 4, 16, 16; 3: 10, 60, 112, 64; 4: 20, 160, 464, 576, 256; 5: 50, 500, 1920, 3520, 3072, 1024; 6: 100, 1200, 5840, 14720, 20224, 14336, 4096; 7: 250, 3500, 20400, 64000, 116480, 122880, 69632, 16384; 8: 500, 8000, 54800, 209600, 488960, 711680, 630784, 311296, 65536; 9: 1250, 22500, 176000, 784000, 2188800, 3968000, 4669440, 3440640, 1441792, 262144;
%F FormulaThe row polynomials satisfy (n-2)*P(n,x) = (5*n-10+(20*n-40)*x+(16*n-32)*x^2)*P(n-2,x) for n >= 3, with P(0,x) = 1, P(1,x) = 2 + 4*x, P(2,x) = 4 + 16*x + 16*x^2.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 2 + 4*x;
P[2, x_] := 4 + 16*x + 16*x^2;
P[n_, x_] := P[n, x] = Expand[Together[((5*n - 10 + (20*n - 40)*x + (16*n - 32)*x^2)*P[n - 2, x])/(n - 2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2 + 4*x; v[3] = 4 + 16*x + 16*x^2; for(n = 3, N, my(i = n + 1); v[i] = ((5*n - 10 + (20*n - 40)*x + (16*n - 32)*x^2)*v[i - 2])/(n - 2)); 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 Geometric basis map (elementary)
-
Hadamard kernel (Malo)?
Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
derived from Geometric basis map (elementary)
Proof chains ? JSON
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
- [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.