A196347 → basis A013609 → D

palindromicγ-positivenonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6Pn(1)
00
122
2161632
3144288144576
4153646084608153612288
519200768001152007680019200307200
627648013824002764800276480013824002764808847360
7451584027095040677376009031680067737600270950404515840289013760
Technical details
Node id
n-29984aa428c2d5e5 · revision 0 · JSON
Definition source
derived:derivative
Fingerprint
f6-77a7ed3b1d5f257e

Observed on the stored rows ?

  • Degrees: -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13 (affine: slope 1, intercept -1)
  • Palindromic rows: yes
  • γ-positive (gamma_positive): yes
  • Nonnegative coefficients (nonn): yes
  • Only rational roots (rr_by_factors: every nonzero row is a product of linear factors over ℚ): yes

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:          0;
  1:          2;
  2:         16,          16;
  3:        144,         288,         144;
  4:       1536,        4608,        4608,        1536;
  5:      19200,       76800,      115200,       76800,        19200;
  6:     276480,     1382400,     2764800,     2764800,      1382400,      276480;
  7:    4515840,    27095040,    67737600,    90316800,     67737600,    27095040,     4515840;
  8:   82575360,   578027520,  1734082560,  2890137600,   2890137600,  1734082560,   578027520,    82575360;
  9: 1672151040, 13377208320, 46820229120, 93640458240, 117050572800, 93640458240, 46820229120, 13377208320, 1672151040;
%F Formula
The row polynomials satisfy (n-1)*P(n,x) = (2*n^2+2*n^2*x)*P(n-1,x) for n >= 2, with P(0,x) = 0, P(1,x) = 2.
%t Mathematica
P[0, x_] := 0;
P[1, x_] := 2;
P[n_, x_] := P[n, x] = Expand[Together[((2*n^2 + 2*n^2*x)*P[n - 1, x])/(n - 1)]];
Table[CoefficientList[P[n, x], x], {n, 0, 9}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N + 1)); v[1] = 0; v[2] = 2; for(n = 2, N, my(i = n + 1); v[i] = ((2*n^2 + 2*n^2*x)*v[i - 1])/(n - 1)); 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. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.