A178822 → basis A013611 → basis A013609

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(30 + 40\,x + 6\,n + 8\,n x\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 1\)

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
1364884
2756201613444116
312096483846451228672153664
4163296870912174182415482885160964840416
51959552130636803483648046448640309657608257536135531648
621555072172440576574801920102187008010218700805449973761211105283478645632
7221709312206928691282771476481839366144024524881920196199055368719958016166094438483487495168
Technical details
Node id
n-6929760447669475 · revision 0 · JSON
Definition source
derived:basis_map_A013609
Fingerprint
f6-c91d5d506c107735

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,           48;
  2:         756,         2016,          1344;
  3:       12096,        48384,         64512,         28672;
  4:      163296,       870912,       1741824,       1548288,        516096;
  5:     1959552,     13063680,      34836480,      46448640,      30965760,        8257536;
  6:    21555072,    172440576,     574801920,    1021870080,    1021870080,      544997376,     121110528;
  7:   221709312,   2069286912,    8277147648,   18393661440,   24524881920,    19619905536,    8719958016,    1660944384;
  8:  2161665792,  23057768448,  107602919424,  286941118464,  478235197440,   510117543936,  340078362624,  129553661952,   21592276992;
  9: 20175547392, 242106568704, 1291235033088, 4017175658496, 8034351316992, 10712468422656, 9522194153472, 5441253801984, 1813751267328, 268703891456;
%F Formula
The row polynomials satisfy n*P(n,x) = (6*n+30+(8*n+40)*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 + (8*n + 40)*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 + (8*n + 40)*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.