A035469 → x ↦ x+1
nonnegative coefficients
Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernelinterlacing (weak)
Recurrence
\(P_{n}(x) = \left(-1 + x + 3\,n\right)\,P_{n-1}(x) + \left(1 + x\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 1 | 1 | 1 | |||||||
| 2 | 5 | 1 | 6 | ||||||
| 3 | 41 | 14 | 1 | 56 | |||||
| 4 | 465 | 211 | 27 | 1 | 704 | ||||
| 5 | 6721 | 3684 | 646 | 44 | 1 | 11096 | |||
| 6 | 117941 | 74325 | 16090 | 1530 | 65 | 1 | 209952 | ||
| 7 | 2433145 | 1710946 | 432895 | 51540 | 3095 | 90 | 1 | 4631712 | |
| 8 | 57673281 | 44361639 | 12687941 | 1785315 | 135555 | 5621 | 119 | 1 | 116649472 |
Compute more
?
Technical details
- Node id
n-5e7006e7019642f6· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-fc5d9467c2602ff9
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: 5, 1; 3: 41, 14, 1; 4: 465, 211, 27, 1; 5: 6721, 3684, 646, 44, 1; 6: 117941, 74325, 16090, 1530, 65, 1; 7: 2433145, 1710946, 432895, 51540, 3095, 90, 1; 8: 57673281, 44361639, 12687941, 1785315, 135555, 5621, 119, 1; 9: 1543866945, 1280813416, 404979932, 65004296, 5880070, 310520, 9436, 152, 1; 10: 46052954821, 40778229289, 14030204196, 2508637684, 260599206, 16494366, 641844, 14916, 189, 1;
%F FormulaThe row polynomials satisfy P(n,x) = (3*n-1+x)*P(n-1,x) + (1+x)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t MathematicaP[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(3*n - 1 + x)*P[n - 1, x] + (1 + x)*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten%o PARI/GPP(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (3*n - 1 + x)*v[i - 1] + (1 + x)*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, v[i])))};
T(10)polytool c48629374597
Properties
- Real-rooted? Every row P_n, n ≥ 1, is zero or real-rooted with all roots in (−∞, -1]
- Coefficients of one sign? Every nonzero row, n ≥ 1: the coefficients of P_n have one sign
- Hadamard kernel (Malo)? Rows P_n, n ≥ 1, are Hadamard kernels (preserve real-rootedness)
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 2
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
- [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.