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.

A364323 Number of partitions of 2n into n parts where each block of part i with multiplicity j is marked with a word of length i*j over a (2n)-ary alphabet whose letters appear in alphabetical order and all 2n letters occur exactly once in the partition.

Table of values

n a(n)
0 1
1 1
2 5
3 76
4 785
5 12181
6 377708
7 8009002
8 171155505
9 4073421919
10 168532394115
11 6213455777530
12 198071252771780
13 6383569557705276
14 204582355050315856
15 8766238064421938746
16 446196770370016437201
17 20584924968627941009331
18 920598569147050035793061

List of values

[1, 1, 5, 76, 785, 12181, 377708, 8009002, 171155505, 4073421919, 168532394115, 6213455777530, 198071252771780, 6383569557705276, 204582355050315856, 8766238064421938746, 446196770370016437201, 20584924968627941009331, 920598569147050035793061]