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.

A261732 Number of partitions of 2n where each part i is marked with a word of length i over an n-ary alphabet whose letters appear in alphabetical order and all n letters occur at least once in the partition.

Table of values

n a(n)
0 1
1 2
2 40
3 1751
4 136516
5 16993932
6 3112631737
7 792794568624
8 269047552566188
9 117558189248146187
10 64343348623810658670
11 43136101281780352785381
12 34769493663713954019980281
13 33175795620329111188048543481
14 36981665738825428991431755534146

List of values

[1, 2, 40, 1751, 136516, 16993932, 3112631737, 792794568624, 269047552566188, 117558189248146187, 64343348623810658670, 43136101281780352785381, 34769493663713954019980281, 33175795620329111188048543481, 36981665738825428991431755534146]