A132393 → basis A013611 → basis A013610

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
151217
230132144306
32101284259217285814
4168012792361444492820736116280
5151201352884788008380807257602488322441880
615120015343206411456141264001731456011197440298598453721360
716632001869192088937856232327872359976960330946560167215104358318081235591280
Technical details
Node id
n-63b2189c6546da91 · revision 0 · JSON
Definition source
derived:basis_map_A013610
Fingerprint
f6-6d68df1a45680a96

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:         5,         12;
  2:        30,        132,         144;
  3:       210,       1284,        2592,        1728;
  4:      1680,      12792,       36144,       44928,        20736;
  5:     15120,     135288,      478800,      838080,       725760,       248832;
  6:    151200,    1534320,     6411456,    14126400,     17314560,     11197440,      2985984;
  7:   1663200,   18691920,    88937856,   232327872,    359976960,    330946560,    167215104,     35831808;
  8:  19958400,  244261440,  1291557312,  3855188736,   7107657984,   8291082240,   5977939968,   2436562944,   429981696;
  9: 259459200, 3414899520, 19721382336, 65616141312, 138661818624, 193075964928, 177206206464, 103410597888, 34828517376, 5159780352;
%F Formula
The row polynomials satisfy P(n,x) = (n+4+12*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[(n + 4 + 12*x)*P[n - 1, x]];
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] = (n + 4 + 12*x)*v[i - 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.