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.

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

Table of values

n a(n)
0 1
1 2
2 49
3 3334
4 428653
5 87804401
6 26047147641
7 10515038040403
8 5527943088161719
9 3662449762145471938
10 2981185419002290273673
11 2921408464370908053081409
12 3389743512704136305019696050
13 4593040689601644978081159072298
14 7182956101782940369861692674495595

List of values

[1, 2, 49, 3334, 428653, 87804401, 26047147641, 10515038040403, 5527943088161719, 3662449762145471938, 2981185419002290273673, 2921408464370908053081409, 3389743512704136305019696050, 4593040689601644978081159072298, 7182956101782940369861692674495595]

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

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