A196347 → basis A013611 → x ↦ x+1

nonnegative coefficientsonly rational roots

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

Recurrence

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

Rows ?

nx0x1x2x3x4x5x6x7Pn(1)
011
16410
2729632200
31296259217283846000
4311048294482944368646144240000
593312031104004147200276480092160012288012000000
63359232013436928022394880019906560099532800265420802949120720000000
7141087744065840947201316818944014631321600975421440039016857608670412808257536050400000000
Technical details
Node id
n-06e4f1e201575b5b · 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:             6,              4;
  2:            72,             96,             32;
  3:          1296,           2592,           1728,            384;
  4:         31104,          82944,          82944,          36864,           6144;
  5:        933120,        3110400,        4147200,        2764800,         921600,         122880;
  6:      33592320,      134369280,      223948800,      199065600,       99532800,       26542080,        2949120;
  7:    1410877440,     6584094720,    13168189440,    14631321600,     9754214400,     3901685760,      867041280,      82575360;
  8:   67722117120,   361184624640,   842764124160,  1123685498880,   936404582400,   499415777280,   166471925760,   31708938240,    2642411520;
  9: 3656994324480, 21941965946880, 58511909191680, 91018525409280, 91018525409280, 60679016939520, 26968451973120, 7705271992320, 1284211998720, 95126814720;
%F Formula
The row polynomials satisfy P(n,x) = (6*n+4*n*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[(6*n + 4*n*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] = (6*n + 4*n*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

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.