A035469 → D+1

nonnegative coefficients

Proved for all n all roots real, in (−∞, 0]coefficients of one signHadamard kernelinterlacing (weak)

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
111
2516
34014155
4440208271676
56160356064044110405
610472070240157201520651192266
7209440015797604160805068030809014144091
8481712004000864011981760173376013384056001191102034920
Technical details
Node id
n-9ae14afeef916271 · revision 0 · JSON
Definition source
derived:one_plus_derivative
Fingerprint
f6-bc765d2be295a474

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,           1;
   3:          40,          14,           1;
   4:         440,         208,          27,          1;
   5:        6160,        3560,         640,         44,         1;
   6:      104720,       70240,       15720,       1520,        65,        1;
   7:     2094400,     1579760,      416080,      50680,      3080,       90,      1;
   8:    48171200,    40008640,    11981760,    1733760,    133840,     5600,    119,     1;
   9:  1252451200,  1128404480,   375497920,   62260800,   5748960,   307440,   9408,   152,   1;
  10: 36321084800, 35104585600, 12768840000, 2367843520, 251976480, 16201920, 636720, 14880, 189, 1;
%F Formula
The row polynomials satisfy P(n,x) = (3*n-1+x)*P(n-1,x) + 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[(3*n - 1 + x)*P[n - 1, x] + 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] = (3*n - 1 + x)*v[i - 1] + 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. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.