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.

A364322 Number of partitions of 2n with largest part n 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 7
3 81
4 841
5 10333
6 137677
7 1973401
8 29150551
9 484498301
10 8769443541
11 167200081777
12 3311785261513
13 66867027890601
14 1437872937193801
15 33031740883673521
16 796918495251727081
17 19807865344255857661
18 501642119664087055501
19 12828972405814319046601

List of values

[1, 1, 7, 81, 841, 10333, 137677, 1973401, 29150551, 484498301, 8769443541, 167200081777, 3311785261513, 66867027890601, 1437872937193801, 33031740883673521, 796918495251727081, 19807865344255857661, 501642119664087055501, 12828972405814319046601]