A008556 → x ↦ x+1

nonnegative coefficients

Proved for all n all roots real, in (−∞, −1]coefficients of one signHadamard kernelinterlacing (weak)

Recurrence

\(\left(n\right)\,P_{n}(x) = \left(-4 - 2\,x + 6\,n + 2\,n x\right)\,P_{n-1}(x) + \left(-8 - 12\,x - 4\,x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
122
28210
3321244
4136726214
5592400601052
626242160480205284
71177611424336028026840
8533445958421840280070137638
9243392307584135072235201260710828
1011169281575360806400178080151202523692140
115149696801856046886401256640147840554419266920
122383590440609536267062408426880127512077616924100932220
13110690816204811776149635200543628801009008086486424024530479640
14515483648102935705682719436834017984074954880836035238438434322795917960

Other recurrences

Image under the basis map A007318 · proved equal for all n (proof step)

\(\left(n\right)\,P_{n}(x) = \left(-4 - 4\,x + 4\,n + 4\,n x\right)\,P_{n-2}(x) + \left(-2 + 4\,n\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 2\)
Technical details
Node id
n-74a29c7cfdef768c · revision 0 · JSON
Definition source
derived:shift_x_plus_one
derived:basis_map_A007318 (equal by e-10d7d1201ce81550)
Fingerprint
f6-e6a1708012e30eb7

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 ℚ): no

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:      1;
  1:      2;
  2:      8,      2;
  3:     32,     12;
  4:    136,     72,      6;
  5:    592,    400,     60;
  6:   2624,   2160,    480,    20;
  7:  11776,  11424,   3360,   280;
  8:  53344,  59584,  21840,  2800,   70;
  9: 243392, 307584, 135072, 23520, 1260;
%F Formula
The row polynomials satisfy n*P(n,x) = (6*n-4+(2*n-2)*x)*P(n-1,x) - (8+12*x+4*x^2)*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1.
%t Mathematica
P[0, x_] := 1;
P[n_, x_] := P[n, x] = Expand[Together[((6*n - 4 + (2*n - 2)*x)*P[n - 1, x] - (8 + 12*x + 4*x^2)*D[P[n - 1, x], x])/(n)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; for(n = 1, N, my(i = n + 1); v[i] = ((6*n - 4 + (2*n - 2)*x)*v[i - 1] - (8 + 12*x + 4*x^2)*deriv(v[i - 1], x))/(n)); 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

Proof chains ? JSON

Same fingerprint ?

References

  1. [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