The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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. 3
 1, 1, 3, 12, 67, 465, 3675, 30024, 299250, 3417690, 38983966, 446295630, 6494597538, 95113861987, 1365645758568, 20909896016688, 373941213111567, 6583031224561656, 114432377809889706, 2158725804226303597, 45003872172663258463, 928103099363098553160 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Andrew Howroyd, Table of n, a(n) for n = 0..200 PROG (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 CROSSREFS Maximum row values of A294201. Cf. A002873. Sequence in context: A289539 A256125 A337059 * A107103 A107887 A187118 Adjacent sequences:  A294199 A294200 A294201 * A294203 A294204 A294205 KEYWORD nonn AUTHOR Andrew Howroyd, Oct 24 2017 EXTENSIONS a(0)=1 prepended by Andrew Howroyd, Sep 20 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 24 13:44 EDT 2021. Contains 345417 sequences. (Running on oeis4.)