A380114 → basis A013611

nonnegative 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(-4 - 8\,x + 4\,n + 8\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 2 + 8\,x\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
12810
284864120
3322566405121440
4128128046087168409617280
5512614428672655367372832768207360
62048286721638404915208192007208962621442488320
781921310728847363276800720896094371846815744209715229859840
Technical details
Node id
n-acacc82d3699f634 · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-e0f7dc6dd641b7f6

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:      2,       8;
  2:      8,      48,       64;
  3:     32,     256,      640,       512;
  4:    128,    1280,     4608,      7168,      4096;
  5:    512,    6144,    28672,     65536,     73728,     32768;
  6:   2048,   28672,   163840,    491520,    819200,    720896,     262144;
  7:   8192,  131072,   884736,   3276800,   7208960,   9437184,    6815744,    2097152;
  8:  32768,  589824,  4587520,  20185088,  55050240,  95420416,  102760448,   62914560,  16777216;
  9: 131072, 2621440, 23068672, 117440512, 381681664, 822083584, 1174405120, 1073741824, 570425344, 134217728;
%F Formula
The row polynomials satisfy (n-1)*P(n,x) = (4*n-4+(8*n-8)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 2 + 8*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 2 + 8*x;
P[n_, x_] := P[n, x] = Expand[Together[((4*n - 4 + (8*n - 8)*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] = 1; v[2] = 2 + 8*x; for(n = 2, N, my(i = n + 1); v[i] = ((4*n - 4 + (8*n - 8)*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. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.