A115951 → θ+1

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1044
2041822
3003680116
40018240350608
5000240140015123152
60008021007560646816208
70000140015120388082745682784
Technical details
Node id
n-c58260973df006a6 · revision 0 · JSON
Definition source
derived:theta_plus_one
Fingerprint
f6-466ef85da4d3295f

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: 0, 4;
  2: 0, 4, 18;
  3: 0, 0, 36,  80;
  4: 0, 0, 18, 240,  350;
  5: 0, 0,  0, 240, 1400,  1512;
  6: 0, 0,  0,  80, 2100,  7560,   6468;
  7: 0, 0,  0,   0, 1400, 15120,  38808,  27456;
  8: 0, 0,  0,   0,  350, 15120,  97020, 192192, 115830;
  9: 0, 0,  0,   0,    0,  7560, 129360, 576576, 926640, 486200;
%F Formula
The row polynomials satisfy (n^3+3*n^2+2*n+2*n^2*x)*P(n,x) = -(2*n^3+4*n^2-2*n-4-(2*n^2+14*n+8)*x-(4*n+4)*x^2)*P(n-1,x) + ((4*n^2+12*n+8)*x+(4*n^2+20*n+16)*x^2+(8*n+8)*x^3)*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[Together[(-(2*n^3 + 4*n^2 - 2*n - 4 - (2*n^2 + 14*n + 8)*x - (4*n + 4)*x^2)*P[n - 1, x] + ((4*n^2 + 12*n + 8)*x + (4*n^2 + 20*n + 16)*x^2 + (8*n + 8)*x^3)*D[P[n - 1, x], x])/(n^3 + 3*n^2 + 2*n + 2*n^2*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*n^3 + 4*n^2 - 2*n - 4 - (2*n^2 + 14*n + 8)*x - (4*n + 4)*x^2)*v[i - 1] + ((4*n^2 + 12*n + 8)*x + (4*n^2 + 20*n + 16)*x^2 + (8*n + 8)*x^3)*deriv(v[i - 1], x))/(n^3 + 3*n^2 + 2*n + 2*n^2*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. [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
  2. [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
  3. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.