cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Table of values

n a(n)
0 1
1 1
2 3
3 12
4 67
5 465
6 3675
7 30024
8 299250
9 3417690
10 38983966
11 446295630
12 6494597538
13 95113861987
14 1365645758568
15 20909896016688
16 373941213111567
17 6583031224561656
18 114432377809889706
19 2158725804226303597
20 45003872172663258463
21 928103099363098553160

List of values

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