A177267: Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having genus k (see first comment for definition of genus).

A177267 ↗ nonnegative coefficients

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

Recurrence from A177267

\(\left(1 + \frac{1}{3}\,n\right)\,P_{n}(x) = \left(2 + \frac{4}{3}\,n\right)\,P_{n-1}(x) + \left(\frac{1}{3}\,n x + \frac{2}{3}\,n^{2} x + \frac{1}{3}\,n^{3} x\right)\,P_{n-2}(x)\)
\(P_{1}(x) = 5 + x\)
\(P_{2}(x) = 14 + 10\,x\)

Rows ?

nx0x1x2x3x4x5x6x7x8Pn(1)
1516
2141024
342708120
4132420168720
5429231021211805040
614301201220790608840320
74862600601741741157208064362880
816796291720130930816244803864963628800
95878613856709087078187487301003173660480039916800
1020801264664605930667618820802018669851238113920479001600
1174290029745716368588220170030946827880652801271140416684288006227020800
1226744401352078002201182984141393766803548275931229817744320539934566487178291200
13969484560843510012716293590109952914500399399285285552088719000222001739280108972864001307674368000
1435357670271455660071430280740808871005800407657601351085882466124006334706026080104021003520020922789888000
1512964479012021607800391710517380567866965380038404067142870116695418439600141006182148960511744745088002324754432000355687428096000
Technical details
Node id
n-3cde4de269220cd9 · revision 0 · JSON
Definition source
oeis_catalog:A177267
Fingerprint
f6-38707c17c5f06fdb

Observed on the stored rows ?

  • Degrees: 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8 (half affine: slope 1, intercept 1)
  • 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 ℚ): no

Matches ?

Row sums ? A000142, A109095, A354074, A342856, A052624, A338112, A124355, A124657

Submission text ?

Atlas rows n = 1, …, ascending powers of x
%e Example
Triangle begins:
   1:      5,       1;
   2:     14,      10;
   3:     42,      70,        8;
   4:    132,     420,      168;
   5:    429,    2310,     2121,       180;
   6:   1430,   12012,    20790,      6088;
   7:   4862,   60060,   174174,    115720,      8064;
   8:  16796,  291720,  1309308,   1624480,    386496;
   9:  58786, 1385670,  9087078,  18748730,  10031736,   604800;
  10: 208012, 6466460, 59306676, 188208020, 186698512, 38113920;
%F Formula
The row polynomials satisfy ((1/3)*n+1)*P(n,x) = ((4/3)*n+2)*P(n-1,x) + ((1/3)*n^3+(2/3)*n^2+(1/3)*n)*x*P(n-2,x) for n >= 3, with P(1,x) = 5 + x, P(2,x) = 14 + 10*x.
%t Mathematica
P[1, x_] := 5 + x;
P[2, x_] := 14 + 10*x;
P[n_, x_] := P[n, x] = Expand[Together[(((4/3)*n + 2)*P[n - 1, x] + ((1/3)*n^3 + (2/3)*n^2 + (1/3)*n)*x*P[n - 2, x])/((1/3)*n + 1)]];
Table[CoefficientList[P[n, x], x], {n, 1, 10}] // Flatten
%o PARI/GP
P(N) = {my(v = vector(N)); v[1] = 5 + x; v[2] = 14 + 10*x; for(n = 3, N, my(i = n); v[i] = (((4/3)*n + 2)*v[i - 1] + ((1/3)*n^3 + (2/3)*n^2 + (1/3)*n)*x*v[i - 2])/((1/3)*n + 1)); v};
row(n, p) = {my(c = Vecrev(p)); c};
T(N) = {my(v = P(N)); concat(vector(#v, i, row(i, v[i])))};
T(10)

polytool c48629374597

Properties

Proof chains ? JSON

  • Liu–Wang theorem for three-term recurrences [LW07, Thm 2.1, Thm 2.3, Cor 2.4, Prop 3.3] polytool ? step › direct check

References

  1. [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