A249247 → 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\right)\,P_{n-2}(x) + \left(n\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 2 + x\)
Rows ?
| n | x0 | x1 | x2 | x3 | x4 | x5 | x6 | x7 | Pn(1) |
|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | 1 | |||||||
| 1 | 2 | 1 | 3 | ||||||
| 2 | 5 | 3 | 8 | ||||||
| 3 | 17 | 12 | 1 | 30 | |||||
| 4 | 73 | 56 | 7 | 136 | |||||
| 5 | 382 | 309 | 48 | 1 | 740 | ||||
| 6 | 2365 | 1983 | 351 | 13 | 4712 | ||||
| 7 | 16937 | 14572 | 2814 | 140 | 1 | 34464 | |||
| 8 | 137861 | 120924 | 24846 | 1484 | 21 | 285136 | |||
| 9 | 1257686 | 1119825 | 241000 | 16310 | 330 | 1 | 2635152 | ||
| 10 | 12714721 | 11457035 | 2555770 | 189430 | 4805 | 31 | 26921792 | ||
| 11 | 141119617 | 128404896 | 29474295 | 2341040 | 69495 | 672 | 1 | 301410016 | |
| 12 | 1706150125 | 1565030508 | 367704345 | 30837680 | 1028175 | 12900 | 43 | 3670763776 | |
| 13 | 22321071242 | 20614921117 | 4938035676 | 432705175 | 15776810 | 237867 | 1232 | 1 | 48322749120 |
| 14 | 314201147513 | 291880076271 | 71065234317 | 6456414475 | 252741195 | 4371213 | 30191 | 57 | 683860015232 |
Compute more
?
Technical details
- Node id
n-0a4cd703d913c76f· revision 0 · JSON- Definition source
derived:shift_x_plus_one- Fingerprint
f6-c9c8bc74c0e4629c
Observed on the stored rows ?
- Degrees: 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7 (half 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 = 0, …, ascending powers of x
%e ExampleTriangle begins: 0: 1; 1: 2, 1; 2: 5, 3; 3: 17, 12, 1; 4: 73, 56, 7; 5: 382, 309, 48, 1; 6: 2365, 1983, 351, 13; 7: 16937, 14572, 2814, 140, 1; 8: 137861, 120924, 24846, 1484, 21; 9: 1257686, 1119825, 241000, 16310, 330, 1;
%F FormulaThe row polynomials satisfy P(n,x) = (1+x)*P(n-2,x) + n*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + x.
%t MathematicaP[0, x_] := 1;
P[1, x_] := 2 + x;
P[n_, x_] := P[n, x] = Expand[(1 + x)*P[n - 2, x] + n*P[n - 1, x]];
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 + x; for(n = 2, N, my(i = n + 1); v[i] = (1 + x)*v[i - 2] + n*v[i - 1]); 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)
- Real-rooted? Every row P_n, n ≥ 0, is zero or real-rooted with all roots in (−∞, 0]
- Interlacing of consecutive rows? Rows P_(m-1), P_m interlace (weak, unordered) for every m ≥ 1
Proof chains ? JSON
References
- [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