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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1426
23636476
350475626881536
49576191521148419081642136
522982457456048636015498013420321459176
666648961999468821881160104378401980540940686461053256
72266064647931226241065004416679704480205170840246130926587321282994880776
Technical details
Node id
n-e879a52793ead02d · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-dcf8348fea013f35

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:            4,             2;
  2:           36,            36,             4;
  3:          504,           756,           268,             8;
  4:         9576,         19152,         11484,          1908,            16;
  5:       229824,        574560,        486360,        154980,         13420,           32;
  6:      6664896,      19994688,      21881160,      10437840,       1980540,        94068,          64;
  7:    226606464,     793122624,    1065004416,     679704480,     205170840,     24613092,      658732,        128;
  8:   8837652096,   35350608384,   56265052032,   45068026752,   18851744520,   3832487568,   301285692,    4611636,      256;
  9: 388856692224, 1749855115008, 3220984279296, 3107454440832, 1669278590784, 487555643232, 69370288344, 3656933028, 32282476, 512;
%F Formula
The row polynomials satisfy P(n,x) = (5*n-1+(5*n-3)*x)*P(n-1,x) - (5*x+5*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[(5*n - 1 + (5*n - 3)*x)*P[n - 1, x] - (5*x + 5*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] = (5*n - 1 + (5*n - 3)*x)*v[i - 1] - (5*x + 5*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