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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1639
260609129
38401260474272601
415120302401860034808167521
5332640831600714000239400248462432142729
68648640259459202865240014061600288186017538072980366529
7259459200908107200122710896079750440025127004033454260123203421873478138281
Technical details
Node id
n-47ad3360622db9f1 · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-b4bba0102ede147f

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:            6,             3;
  2:           60,            60,             9;
  3:          840,          1260,           474,            27;
  4:        15120,         30240,         18600,          3480,            81;
  5:       332640,        831600,        714000,        239400,         24846,          243;
  6:      8648640,      25945920,      28652400,      14061600,       2881860,       175380,         729;
  7:    259459200,     908107200,    1227108960,     797504400,     251270040,     33454260,     1232034,       2187;
  8:   8821612800,   35286451200,   56423727360,   45768602880,   19675444320,   4237410240,   380317200,    8637360,     6561;
  9: 335221286400, 1508495788800, 2786591808000, 2713424313600, 1485537641280, 450106826400, 68885594400, 4269862800, 60500886, 19683;
%F Formula
The row polynomials satisfy P(n,x) = (4*n+2+(4*n-1)*x)*P(n-1,x) - (4*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[(4*n + 2 + (4*n - 1)*x)*P[n - 1, x] - (4*x + 4*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] = (4*n + 2 + (4*n - 1)*x)*v[i - 1] - (4*x + 4*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