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.

A319519 Number of sets of nonempty words with a total of 2n letters over n-ary alphabet such that all n letters occur at least once in the set.

Table of values

n a(n)
0 1
1 1
2 38
3 2811
4 375698
5 78808600
6 23761098837
7 9706198156760
8 5148887208055692
9 3435636331820210328
10 2812707955072045999940
11 2769473851247907714803299
12 3226373218837374171864997818
13 4386692184929838579321027664266
14 6880627149087717821279760600127300

List of values

[1, 1, 38, 2811, 375698, 78808600, 23761098837, 9706198156760, 5148887208055692, 3435636331820210328, 2812707955072045999940, 2769473851247907714803299, 3226373218837374171864997818, 4386692184929838579321027664266, 6880627149087717821279760600127300]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.