A028338 → basis A013611 → D+1

nonnegative coefficients

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
16410
2325616104
3224560384641232
4198460806080230425616704
521376751369408052480128001024256896
62718721057280154470410931203942406758440964432896
739905281679257627517952229877761060864026951683440641638484953088
Technical details
Node id
n-e1a49671f49cd6b3 · revision 0 · JSON
Definition source
derived:one_plus_derivative
Fingerprint
f6-3d7c34cade5a4c40

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:          6,          4;
  2:         32,         56,          16;
  3:        224,        560,         384,          64;
  4:       1984,       6080,        6080,        2304,        256;
  5:      21376,      75136,       94080,       52480,      12800,       1024;
  6:     271872,    1057280,     1544704,     1093120,     394240,      67584,      4096;
  7:    3990528,   16792576,    27517952,    22987776,   10608640,    2695168,    344064,     16384;
  8:   66428928,  298024960,   534351872,   505602048,  277745664,   90832896,  17203200,   1703936,   65536;
  9: 1237008384, 5854593024, 11294269440, 11789434880, 7389634560, 2894610432, 708771840, 104202240, 8257536, 262144;
%F Formula
The row polynomials satisfy P(n,x) = -(4*n^2-8*n+4+(16*n-16)*x+16*x^2)*P(n-2,x) + (4*n-2+8*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 6 + 4*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 6 + 4*x;
P[n_, x_] := P[n, x] = Expand[-(4*n^2 - 8*n + 4 + (16*n - 16)*x + 16*x^2)*P[n - 2, x] + (4*n - 2 + 8*x)*P[n - 1, x]];
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] = 6 + 4*x; for(n = 2, N, my(i = n + 1); v[i] = -(4*n^2 - 8*n + 4 + (16*n - 16)*x + 16*x^2)*v[i - 2] + (4*n - 2 + 8*x)*v[i - 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.