A143491 → basis A008277 → reverse

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7x8x9Pn(1)
0181221
11156060136
21241804803601045
31354202100420025209276
4148840672025200403202016093289
51631512176401058403175204233601814401047376
6180252040320352800169344042336004838400181440012975561
7199396083160997920698544027941760598752005987520019958400175721140
Technical details
Node id
n-40d0ed1d7233db60 · revision 0 · JSON
Definition source
derived:reversal
Fingerprint
f6-caf342f7caa2ed5f

Observed on the stored rows ?

  • Degrees: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 (affine: slope 1, intercept 2)
  • 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,   8,   12;
  1: 1,  15,   60,     60;
  2: 1,  24,  180,    480,     360;
  3: 1,  35,  420,   2100,    4200,     2520;
  4: 1,  48,  840,   6720,   25200,    40320,     20160;
  5: 1,  63, 1512,  17640,  105840,   317520,    423360,     181440;
  6: 1,  80, 2520,  40320,  352800,  1693440,   4233600,    4838400,    1814400;
  7: 1,  99, 3960,  83160,  997920,  6985440,  27941760,   59875200,   59875200,    19958400;
  8: 1, 120, 5940, 158400, 2494800, 23950080, 139708800,  479001600,  898128000,   798336000,   239500800;
  9: 1, 143, 8580, 283140, 5662800, 71351280, 570810240, 2854051200, 8562153600, 14270256000, 11416204800, 3113510400;
%F Formula
The row polynomials satisfy P(n,x) = (1+(2*n+5)*x)*P(n-1,x) - x^2*d/dx P(n-1,x) for n >= 1, with P(0,x) = 1 + 8*x + 12*x^2.
%t Mathematica
P[0, x_] := 1 + 8*x + 12*x^2;
P[n_, x_] := P[n, x] = Expand[(1 + (2*n + 5)*x)*P[n - 1, x] - x^2*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 + 8*x + 12*x^2; for(n = 1, N, my(i = n + 1); v[i] = (1 + (2*n + 5)*x)*v[i - 1] - x^2*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. [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. [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
  5. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.