A178821 → basis A013609 → basis A013610

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(16 + 24\,x + 4\,n + 6\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1203050
22407205401500
322401008015120756035000
41792010752024192024192090720700000
512902496768029030404354560326592097977612600000
68601607741440290304005806080065318400391910409797760210000000
7540672056770560255467520638668800958003200862202880431101440923788803300000000
Technical details
Node id
n-4242efbbaf367697 · revision 0 · JSON
Definition source
derived:basis_map_A013610
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:        20,         30;
  2:       240,        720,         540;
  3:      2240,      10080,       15120,        7560;
  4:     17920,     107520,      241920,      241920,        90720;
  5:    129024,     967680,     2903040,     4354560,      3265920,       979776;
  6:    860160,    7741440,    29030400,    58060800,     65318400,     39191040,      9797760;
  7:   5406720,   56770560,   255467520,   638668800,    958003200,    862202880,    431101440,     92378880;
  8:  32440320,  389283840,  2043740160,  6131220480,  11496038400,  13795246080,  10346434560,   4434186240,   831409920;
  9: 187432960, 2530344960, 15182069760, 53137244160, 119558799360, 179338199040, 179338199040, 115288842240, 43233315840, 7205552640;
%F Formula
The row polynomials satisfy n*P(n,x) = (4*n+16+(6*n+24)*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[((4*n + 16 + (6*n + 24)*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] = ((4*n + 16 + (6*n + 24)*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.