A257615 → 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(8 + 3\,x + 2\,n + 2\,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
110515
212012025265
31680252010901255415
42688053760357608880625125905
5483840120960010920004284006841031253285375
6967680029030400331968001800960046765205101201562595115865
72128896007451136001032998400719712000263576880482101203727090781253026305815
Technical details
Node id
n-98b23464d77c0584 · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-77f8f710632b75b3

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:           10,            5;
  2:          120,          120,            25;
  3:         1680,         2520,          1090,           125;
  4:        26880,        53760,         35760,          8880,          625;
  5:       483840,      1209600,       1092000,        428400,        68410,         3125;
  6:      9676800,     29030400,      33196800,      18009600,      4676520,       510120,       15625;
  7:    212889600,    745113600,    1032998400,     719712000,    263576880,     48210120,     3727090,      78125;
  8:   5109350400,  20437401600,   33326899200,   28449792000,  13573486080,   3574287360,   478616160,   26870880,    390625;
  9: 132843110400, 597793996800, 1121502412800, 1135553126400, 671069629440, 233643916800, 46017787200, 4629996000, 192002410, 1953125;
%F Formula
The row polynomials satisfy P(n,x) = (2*n+8+(2*n+3)*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 + 8 + (2*n + 3)*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 + 8 + (2*n + 3)*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