A119308 → basis A013609

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1325
2914427
32870488154
49031235214416914
5297132021001440400325589
6100154341122011000520010566434975
7343222022560567207249280172482688128222926
Technical details
Node id
n-eaddbafbdfb5ca13 · revision 0 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-a10e516e57874c56

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:     3,      2;
  2:     9,     14,       4;
  3:    28,     70,      48,       8;
  4:    90,    312,     352,     144,      16;
  5:   297,   1320,    2100,    1440,     400,      32;
  6:  1001,   5434,   11220,   11000,    5200,    1056,     64;
  7:  3432,  22022,   56056,   72072,   49280,   17248,   2688,    128;
  8: 11934,  88400,  267904,  428064,  387296,  198016,  53760,   6656,   256;
  9: 41990, 352716, 1241136, 2376192, 2690688, 1834560, 733824, 159744, 16128, 512;
%F Formula
The row polynomials satisfy (n+3)*P(n,x) = (4*n-8)*x^2*P(n-3,x) - (4*n-2+(4*n-2)*x+4*n*x^2)*P(n-2,x) + (5*n+7+(4*n+6)*x)*P(n-1,x) for n >= 3, with P(0,x) = 1, P(1,x) = 3 + 2*x, P(2,x) = 9 + 14*x + 4*x^2.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 3 + 2*x;
P[2, x_] := 9 + 14*x + 4*x^2;
P[n_, x_] := P[n, x] = Expand[Together[((4*n - 8)*x^2*P[n - 3, x] - (4*n - 2 + (4*n - 2)*x + 4*n*x^2)*P[n - 2, x] + (5*n + 7 + (4*n + 6)*x)*P[n - 1, x])/(n + 3)]];
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] = 3 + 2*x; v[3] = 9 + 14*x + 4*x^2; for(n = 3, N, my(i = n + 1); v[i] = ((4*n - 8)*x^2*v[i - 3] - (4*n - 2 + (4*n - 2)*x + 4*n*x^2)*v[i - 2] + (5*n + 7 + (4*n + 6)*x)*v[i - 1])/(n + 3)); 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. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.