A294202 The maximal number of partitions of {1..3n} that are invariant under a permutation consisting of n 3-cycles, and which have the same number of nonempty parts.

1, 1, 3, 12, 67, 465, 3675, 30024, 299250, 3417690, 38983966, 446295630, 6494597538, 95113861987, 1365645758568, 20909896016688, 373941213111567, 6583031224561656, 114432377809889706, 2158725804226303597, 45003872172663258463, 928103099363098553160

Offset: 0

Author

Andrew Howroyd, Oct 24 2017

Keywords

• nonn

Links

• Andrew Howroyd, Table of n, a(n) for n = 0..200

Crossrefs

Maximum row values of A294201.

Cf. A002873.

Programs

PARI

G(n)={Vec(serlaplace(exp(sumdiv(3, d, y^d*(exp(d*x + O(x*x^n))-1)/d))))}
seq(n)={my(A=G(n)); vector(#A, n, vecmax(Vec(A[n])))} \\ Andrew Howroyd, Sep 20 2019

Extensions

a(0)=1 prepended by Andrew Howroyd, Sep 20 2019