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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1426
22020444
3120176728376
48321584976224163632
56496150721232043206403238880
6561281527041546247296016640172864454848
75299201646976198016011719683628805824044801285754752
Technical details
Node id
n-867753e2092cf52b · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-1090d35600282d8c

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:       20,        20,         4;
  3:      120,       176,        72,         8;
  4:      832,      1584,       976,       224,        16;
  5:     6496,     15072,     12320,      4320,       640,       32;
  6:    56128,    152704,    154624,     72960,     16640,     1728,      64;
  7:   529920,   1646976,   1980160,   1171968,    362880,    58240,    4480,    128;
  8:  5413632,  18862336,  26167040,  18583040,   7280896,  1594880,  189952,  11264,   256;
  9: 59379200, 228669440, 358559232, 296411648, 140485632, 39169536, 6386688, 586752, 27648, 512;
%F Formula
The row polynomials satisfy P(n,x) = (4+2*x)*P(n-1,x) + (2+2*x)*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 + 2*x)*P[n - 1, x] + (2 + 2*x)*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 + 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 - 1, v[i])))};
T(9)

polytool c48629374597

Properties

Proof chains ? JSON

Same fingerprint ?

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. [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
  4. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.