A178822 → basis A013611 → basis A007318

nonnegative coefficientsonly rational roots

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

Recurrence

\(\left(n\right)\,P_{n}(x) = \left(30 + 20\,x + 6\,n + 4\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1362460
275610083362100
3120962419216128358456000
4163296435456435456193536322561260000
51959552653184087091205806080193536025804825200000
6215550728622028814370048012773376063866880170311681892352462000000
72217093121034643456206928691222992076801532805120613122048136249344129761287920000000
Technical details
Node id
n-bf590b1292365cf7 · revision 0 · JSON
Definition source
derived:shift_x_plus_one
Fingerprint
f6-f06e51c139cfae05

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:          36,           24;
  2:         756,         1008,          336;
  3:       12096,        24192,        16128,         3584;
  4:      163296,       435456,       435456,       193536,        32256;
  5:     1959552,      6531840,      8709120,      5806080,      1935360,       258048;
  6:    21555072,     86220288,    143700480,    127733760,     63866880,     17031168,      1892352;
  7:   221709312,   1034643456,   2069286912,   2299207680,   1532805120,    613122048,    136249344,    12976128;
  8:  2161665792,  11528884224,  26900729856,  35867639808,  29889699840,  15941173248,   5313724416,  1012137984,   84344832;
  9: 20175547392, 121053284352, 322808758272, 502146957312, 502146957312, 334764638208, 148784283648, 42509795328, 7084965888, 524812288;
%F Formula
The row polynomials satisfy n*P(n,x) = (6*n+30+(4*n+20)*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[((6*n + 30 + (4*n + 20)*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] = ((6*n + 30 + (4*n + 20)*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.