A356546 → basis A013609 → basis A013611

nonnegative coefficientsonly rational roots

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

Recurrence

\(\left(n\right)\,P_{n}(x) = \left(-8 - 16\,x + 16\,n + 32\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
181624
296384384864
312807680153601024034560
4179201433604300805734402867201451520
52580482580480103219202064384020643840825753662705664
63784704454164482270822406055526409083289607266631682422210562759049216
7562298887872184324723310592157443686403148873728037786484736251909898247197425664122974765056
Technical details
Node id
n-f047ab7ef03b5b1b · revision 0 · JSON
Definition source
derived:basis_map_A013611
Fingerprint
f6-11aec07ce60b6d61

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:           8,           16;
  2:          96,          384,           384;
  3:        1280,         7680,         15360,         10240;
  4:       17920,       143360,        430080,        573440,         286720;
  5:      258048,      2580480,      10321920,      20643840,       20643840,        8257536;
  6:     3784704,     45416448,     227082240,     605552640,      908328960,      726663168,      242221056;
  7:    56229888,    787218432,    4723310592,   15744368640,    31488737280,    37786484736,    25190989824,     7197425664;
  8:   843448320,  13495173120,   94466211840,  377864847360,   944662118400,  1511459389440,  1511459389440,   863691079680,   215922769920;
  9: 12745441280, 229417943040, 1835343544320, 8564936540160, 25694809620480, 51389619240960, 68519492321280, 58730993418240, 29365496709120, 6525665935360;
%F Formula
The row polynomials satisfy n*P(n,x) = (16*n-8+(32*n-16)*x)*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[((16*n - 8 + (32*n - 16)*x)*P[n - 1, x])/(n)]];
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] = ((16*n - 8 + (32*n - 16)*x)*v[i - 1])/(n)); 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.