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.

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

Table of values

n a(n)
0 1
1 1
2 3
3 10
4 53
5 265
6 1700
7 13097
8 96796
9 829080
10 8009815
11 75604892
12 808861988
13 9175286549
14 106167118057
15 1320388106466
16 16950041305210
17 233232366601078
18 3243603207488124
19 47776065074368313
20 733990397879859192
21 11515503147927664816
22 189107783918416912912

List of values

[1, 1, 3, 10, 53, 265, 1700, 13097, 96796, 829080, 8009815, 75604892, 808861988, 9175286549, 106167118057, 1320388106466, 16950041305210, 233232366601078, 3243603207488124, 47776065074368313, 733990397879859192, 11515503147927664816, 189107783918416912912]