A274496 → basis A013611 → D
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernel
Recurrence
\(\left(-2 + n\right)\,P_{n}(x) = \left(-16 + 6\,n - 12\,n x + 4\,n^{2} x\right)\,P_{n-1}(x) + \left(-4 - 8\,x - 4\,n x - 8\,n x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 0\)
\(P_{1}(x) = 0\)
\(P_{2}(x) = 8\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | Pn(1) |
|---|---|---|---|---|---|---|---|---|
| 0 | 0 | |||||||
| 1 | 0 | |||||||
| 2 | 8 | 8 | ||||||
| 3 | 16 | 16 | ||||||
| 4 | 64 | 128 | 192 | |||||
| 5 | 128 | 256 | 384 | |||||
| 6 | 384 | 1536 | 1536 | 3456 | ||||
| 7 | 768 | 3072 | 3072 | 6912 | ||||
| 8 | 2048 | 12288 | 24576 | 16384 | 55296 | |||
| 9 | 4096 | 24576 | 49152 | 32768 | 110592 | |||
| 10 | 10240 | 81920 | 245760 | 327680 | 163840 | 829440 | ||
| 11 | 20480 | 163840 | 491520 | 655360 | 327680 | 1658880 | ||
| 12 | 49152 | 491520 | 1966080 | 3932160 | 3932160 | 1572864 | 11943936 | |
| 13 | 98304 | 983040 | 3932160 | 7864320 | 7864320 | 3145728 | 23887872 | |
| 14 | 229376 | 2752512 | 13762560 | 36700160 | 55050240 | 44040192 | 14680064 | 167215104 |
Compute more
?
Technical details
- Node id
n-3043ddc2cda841ee· revision 0 · JSON- Definition source
derived:derivative- Fingerprint
f6-98cc1557e904900a
Observed on the stored rows ?
- Degrees: -1, -1, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6 (half affine: slope 1, intercept -2)
- 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 ℚ): yes
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 0; 1: 0; 2: 8; 3: 16; 4: 64, 128; 5: 128, 256; 6: 384, 1536, 1536; 7: 768, 3072, 3072; 8: 2048, 12288, 24576, 16384; 9: 4096, 24576, 49152, 32768;
%F FormulaThe row polynomials satisfy (n-2)*P(n,x) = (6*n-16+(4*n^2-12*n)*x)*P(n-1,x) - (4+(4*n+8)*x+8*n*x^2)*d/dx P(n-1,x) for n >= 3, with P(0,x) = 0, P(1,x) = 0, P(2,x) = 8.
%t MathematicaP[0, x_] := 0;
P[1, x_] := 0;
P[2, x_] := 8;
P[n_, x_] := P[n, x] = Expand[Together[((6*n - 16 + (4*n^2 - 12*n)*x)*P[n - 1, x] - (4 + (4*n + 8)*x + 8*n*x^2)*D[P[n - 1, x], x])/(n - 2)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten%o PARI/GPP(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 0; v[3] = 8; for(n = 3, N, my(i = n + 1); v[i] = ((6*n - 16 + (4*n^2 - 12*n)*x)*v[i - 1] - (4 + (4*n + 8)*x + 8*n*x^2)*deriv(v[i - 1], x))/(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 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
Proof chains ? JSON
Related ?
Same fingerprint ?
- A152198 → basis A013609 → basis A007318
- A152198 → basis A013611 → basis A013610
- A274498: Triangle read by rows: T(n,k) is the number of ternary words of length n having degree of asymmetry equal to k…
- A188440: Triangle T(n,k) read by rows: number of size-k antisymmetric subsets of {1,2,...,n}.
- A188440 → basis A013610
- A274496 → basis A013611
- A274496 → basis A013611 → basis A013610
- A103633 → x ↦ x/(x+1)
- A152198 → x ↦ x+1
- A274496 → D → x ↦ x+1
- A188440 → D
- A274498 → basis A013610
- A152198 → basis A013609 → basis A013611
- A274498 → D
- A274498 → D → D
- A152198 → x ↦ x+1 → D
- A274496 → x ↦ x+1
- A152198 → basis A013611
- A152198 → basis A013611 → D
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.