A306364 → 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 + 2\,n + n x\right)\,P_{n-1}(x) + \left(-2\,x - 2\,x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
133
215318
310545150
4945630451620
5103959450157521420
6135135155925425251575335160
7202702528378351091475992256055560
8344594255675670028378350436590099225124059600
9654729075124053930076621545017027010098232752841577200
101374931057529462808375217094377506385128750638512875982327571955021600
113162341432257562120816256481817842502388038152503511820812514047283251995954760800
127905853580625208714534528502041772620387590745449795001791028614375126425549250140472832560188437108800
132134580466768756166565792887506783222372176253539072542005008847681355012593133487947502739220233751960408201752000
14619028335362937519424682247595625237412783026168751424476698157012543353638639561256193376948508753259672078162527392202337568588583087024000

Other recurrences

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

\(P_{n}(x) = \left(-x + n^{2} x\right)\,P_{n-2}(x) + \left(1 + 2\,n\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 3\)
Technical details
Node id
n-bab8f81b674979eb · revision 0 · JSON
Definition source
derived:shift_x_plus_one
derived:basis_map_A007318 (equal by e-5344783b25882878)
Fingerprint
f6-803a5d83f859558a

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:         3;
  2:        15,          3;
  3:       105,         45;
  4:       945,        630,        45;
  5:     10395,       9450,      1575;
  6:    135135,     155925,     42525,      1575;
  7:   2027025,    2837835,   1091475,     99225;
  8:  34459425,   56756700,  28378350,   4365900,   99225;
  9: 654729075, 1240539300, 766215450, 170270100, 9823275;
%F Formula
The row polynomials satisfy P(n,x) = (2*n+1+(n-1)*x)*P(n-1,x) - (2*x+2*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[(2*n + 1 + (n - 1)*x)*P[n - 1, x] - (2*x + 2*x^2)*D[P[n - 1, x], x]];
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] = (2*n + 1 + (n - 1)*x)*v[i - 1] - (2*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

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