A225476 → x ↦ x+1

nonnegative coefficients

Proved for all n all roots real, in (−3, −1)coefficients of one signHadamard kernelinterlacing (weak)

Recurrence

\(P_{n}(x) = \left(2 + x\right)\,P_{n-1}(x) + \left(3 + 4\,x + x^{2}\right)\,P_{n-1}'(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1213
278217
33867366147
4277656548192241697
52522750185204620120012024483
62754798648141782104640418808640720423857
735103814701272556876239286613020004124407056050408560947
Technical details
Node id
n-4e118a5f86e56b36 · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-470e0be37b3b9576

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:        2,         1;
  2:        7,         8,          2;
  3:       38,        67,         36,          6;
  4:      277,       656,        548,        192,         24;
  5:     2522,      7501,       8520,       4620,       1200,       120;
  6:    27547,     98648,     141782,     104640,      41880,      8640,       720;
  7:   351038,   1470127,    2556876,    2392866,    1302000,    412440,     70560,     5040;
  8:  5112457,  24513056,   50044808,   56794752,   39194064,  16853760,   4415040,   645120,   40320;
  9: 83764082, 452459641, 1060626960, 1415589720, 1185478560, 646223760, 229461120, 51226560, 6531840, 362880;
%F Formula
The row polynomials satisfy P(n,x) = (2+x)*P(n-1,x) + (3+4*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[(2 + x)*P[n - 1, x] + (3 + 4*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] = (2 + x)*v[i - 1] + (3 + 4*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. [MW08] Shi-Mei Ma and Yi Wang. q-Eulerian polynomials and polynomials with only real zeros. The Electronic Journal of Combinatorics, 15(1):Research Paper 17, January 2008. doi:10.37236/741