Triangle read by rows: T(n, m) = S1(n, m)*6^(n-m), where S1 are the signed Stirling numbers of first kind A008275 (n >= 1, 1 <= m <= n).

A051151 (tail) ↗ only rational roots

Proved for all n all roots real, in [0, ∞)alternating coefficient signsinterlacing (weak)

Recurrence from A051151

\(P_{n}(x) = \left(-12 + x - 6\,n\right)\,P_{n-1}(x)\)
\(P_{0}(x) = 72 - 18\,x + x^{2}\)

Rows ?

nx0x1x2x3x4x5x6x7x8x9Pn(1)
072-18155
1-1296396-361-935
231104-108001260-60121505
3-933120355104-486003060-901-623645
433592320-137168642104704-1587606300-126121827575
5-1410877440609700608-1021144328772624-42336011592-1681-894930575
667722117120-306765066245511193344-52320038429093904-97977619656-216142061737025
7-36569943244801724253474816-32828094720033764014080-209427120082001808-204120031320-2701-2229272062325
Technical details
Node id
n-380b79aacd7d0dd2 · revision 0 · JSON
Definition source
oeis_catalog:A051151
Fingerprint
f6-6b6154934dc9ab46

Observed on the stored rows ?

  • Degrees: 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 (affine: slope 1, intercept 2)
  • Palindromic rows: no
  • γ-positive (gamma_positive): no
  • Nonnegative coefficients (nonn): no
  • 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:                 72,              -18,                 1;
  1:              -1296,              396,               -36,               1;
  2:              31104,           -10800,              1260,             -60,               1;
  3:            -933120,           355104,            -48600,            3060,             -90,            1;
  4:           33592320,        -13716864,           2104704,         -158760,            6300,         -126,            1;
  5:        -1410877440,        609700608,        -102114432,         8772624,         -423360,        11592,         -168,         1;
  6:        67722117120,     -30676506624,        5511193344,      -523200384,        29093904,      -979776,        19656,      -216,        1;
  7:     -3656994324480,    1724253474816,     -328280947200,     33764014080,     -2094271200,     82001808,     -2041200,     31320,     -270,     1;
  8:    219419659468800, -107112202813440,    21421110306816,  -2354121792000,    159420286080,  -7014379680,    204473808,  -3920400,    47520,  -330,    1;
  9: -14481697524940800, 7288825045155840, -1520905483063296, 176793148578816, -12875860673280, 622369344960, -20509651008, 463220208, -7056720, 69300, -396, 1;
%F Formula
The row polynomials satisfy P(n,x) = -(6*n+12-x)*P(n-1,x) for n >= 1, with P(0,x) = 72 - 18*x + x^2.
%t Mathematica
P[0, x_] := 72 - 18*x + x^2;
P[n_, x_] := P[n, x] = Expand[-(6*n + 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] = 72 - 18*x + x^2; for(n = 1, N, my(i = n + 1); v[i] = -(6*n + 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. [SP14] J Schur and G Polya. Über zwei Arten von Faktorenfolgen in der Theorie der algebraischen Gleichungen. J. Reine Angew. Math., 1914.