A274496 → x ↦ x+1 → x ↦ x+1
nonnegative coefficientsonly rational roots
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernel
Recurrence
\(P_{n}(x) = \left(1 - x + n + n x\right)\,P_{n-1}(x) + \left(-6 - 8\,x - 2\,x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 2 | 2 | |||||||
| 2 | 6 | 2 | 8 | ||||||
| 3 | 12 | 4 | 16 | ||||||
| 4 | 36 | 24 | 4 | 64 | |||||
| 5 | 72 | 48 | 8 | 128 | |||||
| 6 | 216 | 216 | 72 | 8 | 512 | ||||
| 7 | 432 | 432 | 144 | 16 | 1024 | ||||
| 8 | 1296 | 1728 | 864 | 192 | 16 | 4096 | |||
| 9 | 2592 | 3456 | 1728 | 384 | 32 | 8192 | |||
| 10 | 7776 | 12960 | 8640 | 2880 | 480 | 32 | 32768 | ||
| 11 | 15552 | 25920 | 17280 | 5760 | 960 | 64 | 65536 | ||
| 12 | 46656 | 93312 | 77760 | 34560 | 8640 | 1152 | 64 | 262144 | |
| 13 | 93312 | 186624 | 155520 | 69120 | 17280 | 2304 | 128 | 524288 | |
| 14 | 279936 | 653184 | 653184 | 362880 | 120960 | 24192 | 2688 | 128 | 2097152 |
Compute more
?
Technical details
- Node id
n-fd2095bd14a92d5d· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-f51bd8e56ed79f3c
Observed on the stored rows ?
- Degrees: 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7 (half 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 ℚ): yes
Matches ?
No OEIS matches.
Submission text ?
Atlas rows n = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 2; 2: 6, 2; 3: 12, 4; 4: 36, 24, 4; 5: 72, 48, 8; 6: 216, 216, 72, 8; 7: 432, 432, 144, 16; 8: 1296, 1728, 864, 192, 16; 9: 2592, 3456, 1728, 384, 32;
%F FormulaThe row polynomials satisfy P(n,x) = (n+1+(n-1)*x)*P(n-1,x) - (6+8*x+2*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t MathematicaP[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(n + 1 + (n - 1)*x)*P[n - 1, x] - (6 + 8*x + 2*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; for(n = 1, N, my(i = n + 1); v[i] = (n + 1 + (n - 1)*x)*v[i - 1] - (6 + 8*x + 2*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 (−∞, -1]
- Coefficients of one sign? Every nonzero row, n ≥ 0: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 0, are Hadamard kernels (preserve real-rootedness)
Proof chains ? JSON
-
Affine, reversal and Möbius substitutions (elementary) polytool ? step ›
Related ?
Same fingerprint ?
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.