A178820 → basis A013609 → D+1

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
116824
212016040320
364014409601603200
42800896010080448056026880
510752448007168053760179201792200704
6376321935364032004300802419206451253761376256
7122880752640193536026880002150400967680215040153608847360
Technical details
Node id
n-aca43f562a3db171 · revision 0 · JSON
Definition source
derived:one_plus_derivative
Fingerprint
f6-e99c3824c4864868

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 ℚ): yes

Matches ?

No OEIS matches.

Submission text ?

Atlas rows n = 0, …, ascending powers of x
%e Example
Triangle begins:
  0:       1;
  1:      16,       8;
  2:     120,     160,       40;
  3:     640,    1440,      960,      160;
  4:    2800,    8960,    10080,     4480,      560;
  5:   10752,   44800,    71680,    53760,    17920,     1792;
  6:   37632,  193536,   403200,   430080,   241920,    64512,     5376;
  7:  122880,  752640,  1935360,  2688000,  2150400,   967680,   215040,    15360;
  8:  380160, 2703360,  8279040, 14192640, 14784000,  9461760,  3548160,   675840,   42240;
  9: 1126400, 9123840, 32440320, 66232320, 85155840, 70963200, 37847040, 12165120, 2027520, 112640;
%F Formula
The row polynomials satisfy (n^2+n*x)*P(n,x) = (2*n^2+8*n+6+(2*n^2+10*n+12)*x+(2*n+6)*x^2)*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^2 + 8*n + 6 + (2*n^2 + 10*n + 12)*x + (2*n + 6)*x^2)*P[n - 1, x])/(n^2 + n*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^2 + 8*n + 6 + (2*n^2 + 10*n + 12)*x + (2*n + 6)*x^2)*v[i - 1])/(n^2 + n*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. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.