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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1549
230451691
3210450305641029
4168046204530184525612931
515120504006405038250105051024179349
61512005896809156007161002925305764540962726851
7166320074088001354752013053600706041021010503087051638445159669
Technical details
Node id
n-8fd7e451a6f8a0e6 · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-0a560bfbcc45e3fa

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 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:         5,          4;
  2:        30,         45,         16;
  3:       210,        450,        305,         64;
  4:      1680,       4620,       4530,       1845,        256;
  5:     15120,      50400,      64050,      38250,      10505,       1024;
  6:    151200,     589680,     915600,     716100,     292530,      57645,      4096;
  7:   1663200,    7408800,   13547520,   13053600,    7060410,    2101050,    308705,    16384;
  8:  19958400,   99792000,  209563200,  239410080,  160912080,   64130220,  14458530,  1625445,   65536;
  9: 259459200, 1437004800, 3402907200, 4489732800, 3602899440, 1800338400, 550121250, 96503850, 8454905, 262144;
%F Formula
The row polynomials satisfy P(n,x) = (n+4+(n+3)*x)*P(n-1,x) - (x+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[(n + 4 + (n + 3)*x)*P[n - 1, x] - (x + 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] = (n + 4 + (n + 3)*x)*v[i - 1] - (x + 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

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