A193734 → 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(-5 - 16\,x + 5\,n + 16\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)
\(P_{1}(x) = 3 + 8\,x\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
13811
21588128231
375680204820484851
43754600211204300832768101871
51875290001792005529608519685242882139291
69375175000136000056320001310720016252928838860844925111
7468751025000960000049920000155648000290979840301989888134217728943427331
Technical details
Node id
n-9da5f4ecd145c4b3 · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-0f9e911990564e19

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:       3,        8;
  2:      15,       88,       128;
  3:      75,      680,      2048,       2048;
  4:     375,     4600,     21120,      43008,       32768;
  5:    1875,    29000,    179200,     552960,      851968,      524288;
  6:    9375,   175000,   1360000,    5632000,    13107200,    16252928,     8388608;
  7:   46875,  1025000,   9600000,   49920000,   155648000,   290979840,   301989888,    134217728;
  8:  234375,  5875000,  64400000,  403200000,  1576960000,  3945267200,  6165626880,   5502926848,  2147483648;
  9: 1171875, 33125000, 416000000, 3046400000, 14336000000, 44957696000, 93952409600, 126164664320, 98784247808, 34359738368;
%F Formula
The row polynomials satisfy (n-1)*P(n,x) = (5*n-5+(16*n-16)*x)*P(n-1,x) for n >= 2, with P(0,x) = 1, P(1,x) = 3 + 8*x.
%t Mathematica
P[0, x_] := 1;
P[1, x_] := 3 + 8*x;
P[n_, x_] := P[n, x] = Expand[Together[((5*n - 5 + (16*n - 16)*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] = 3 + 8*x; for(n = 2, N, my(i = n + 1); v[i] = ((5*n - 5 + (16*n - 16)*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

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.