A161198 → basis A008277 → 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 + 2\,x + 2\,n\right)\,P_{n-1}(x) + \left(2 + 2\,x\right)\,P_{n-1}'(x)\)
\(P_{1}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
2527
33928471
44074021088925
55281647224723521614593
6815971175305708011760104032269039
7145901523895241390140369440477602880645658823
82958230353879546361886281165948019616801740487616128133453429
Technical details
Node id
n-4822161ac0654b6f · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-5d3691bcc41fb646

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 -1)
  • 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 = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:           1;
   2:           5,           2;
   3:          39,          28,           4;
   4:         407,         402,         108,           8;
   5:        5281,        6472,        2472,         352,         16;
   6:       81597,      117530,       57080,       11760,       1040,        32;
   7:     1459015,     2389524,     1390140,      369440,      47760,      2880,       64;
   8:    29582303,    53879546,    36188628,    11659480,    1961680,    174048,     7616,     128;
   9:   669822849,  1335389584,  1010054416,   379557696,   78024800,   9062144,   585984,   19456,   256;
  10: 16737058997, 36093823794, 30199485744, 12892365024, 3112456032, 444007872, 37734144, 1857024, 48384, 512;
%F Formula
The row polynomials satisfy P(n,x) = (2*n+1+2*x)*P(n-1,x) + (2+2*x)*d/dx P(n-1,x) for n >= 2, with P(1,x) = 1.
%t Mathematica
P[1, x_] := 1;
P[n_, x_] := P[n, x] = Expand[(2*n + 1 + 2*x)*P[n - 1, x] + (2 + 2*x)*D[P[n - 1, x], x]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 1; for(n = 2, N, my(i = n); v[i] = (2*n + 1 + 2*x)*v[i - 1] + (2 + 2*x)*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, v[i])))};
T(10)

polytool c48629374597

Properties

Proof chains ? JSON

References

  1. [Bra06] Petter Brändén. On linear transformations preserving the Pólya frequency property. Transactions of the American Mathematical Society, 358(8):3697–3716, February 2006. doi:10.1090/s0002-9947-06-03856-6
  2. [Bra15] Petter Brändén. Unimodality, log-concavity, real-rootedness and beyond. Handbook of enumerative combinatorics, :437–483, March 2015. doi:10.1201/b18255-10
  3. [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
  4. [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
  5. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.