A128813 → D+1

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1213
2510318
311648118174
42127499110081802474
53688970062019318000270048824
657238034642213372536553437400567001281104
7855544133818149582879264531818248413891500158760043223312
Technical details
Node id
n-7a8f239d989ba059 · revision 0 · JSON
Definition source
derived:one_plus_derivative
Fingerprint
f6-cc8071de9b089857

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:   5,    10,       3;
  3:  11,    64,      81,       18;
  4:  21,   274,     991,     1008,       180;
  5:  36,   889,    7006,    20193,     18000,       2700;
  6:  57,  2380,   34642,   213372,    536553,     437400,       56700;
  7:  85,  5544,  133818,  1495828,   7926453,   18182484,    13891500,     1587600;
  8: 121, 11628,  431682,  7886332,  74845449,  357991416,   768479724,   558835200,    57153600;
  9: 166, 22473, 1213872, 33700942, 516854394, 4382220861, 19453665024, 39712710780, 27776649600, 2571912000;
%F Formula
The row polynomials satisfy (4*n-4)*P(n,x) = -(4*n+4+(4*n^3-4*n)*x+(n^5-n^4-n^3+n^2)*x^2)*P(n-2,x) + (8*n+(4*n^3-4*n)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2 + x;
P[n_, x_] := P[n, x] = Expand[Together[(-(4*n + 4 + (4*n^3 - 4*n)*x + (n^5 - n^4 - n^3 + n^2)*x^2)*P[n - 2, x] + (8*n + (4*n^3 - 4*n)*x)*P[n - 1, x])/(4*n - 4)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 1; v[2] = 2 + x; for(n = 2, N, my(i = n + 1); v[i] = (-(4*n + 4 + (4*n^3 - 4*n)*x + (n^5 - n^4 - n^3 + n^2)*x^2)*v[i - 2] + (8*n + (4*n^3 - 4*n)*x)*v[i - 1])/(4*n - 4)); 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. [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.