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.

A292725 Number of multisets of nonempty words with a total of n letters over 10-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 73562956
12 592088950
13 4560084092
14 37322365393
15 303133205967
16 2640424710926
17 22786686453050
18 210764523790244
19 1891228958070987
20 18197644702881767
21 155143878113188799
22 1411297482751989322

List of values

[1, 1, 4, 14, 67, 343, 2151, 14900, 119259, 1055520, 10465854, 73562956, 592088950, 4560084092, 37322365393, 303133205967, 2640424710926, 22786686453050, 210764523790244, 1891228958070987, 18197644702881767, 155143878113188799, 1411297482751989322]