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.

A292713 Number of multisets of nonempty words with a total of n letters over n-ary alphabet such that within each word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.

Table of values

n a(n)
0 1
1 1
2 4
3 14
4 67
5 343
6 2151
7 14900
8 119259
9 1055520
10 10465854
11 113479756
12 1350508150
13 17373376892
14 241576630993
15 3596468789967
16 57232276979726
17 967517444008250
18 17339617861447844
19 328037083000497867
20 6537494747743375847
21 136820214583596515519

List of values

[1, 1, 4, 14, 67, 343, 2151, 14900, 119259, 1055520, 10465854, 113479756, 1350508150, 17373376892, 241576630993, 3596468789967, 57232276979726, 967517444008250, 17339617861447844, 328037083000497867, 6537494747743375847, 136820214583596515519]

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

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