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.

A293740 Number of multisets of nonempty words with a total of n letters over denary alphabet such that within each prefix of a 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 3
3 7
4 20
5 54
6 164
7 500
8 1630
9 5472
10 19257
11 70132
12 265845
13 1042187
14 4233556
15 17747898
16 76808746
17 342105748
18 1567582938
19 7371055703
20 35543320641
21 175391546006
22 884988267329
23 4558168670317
24 23945579145172
25 128119583103268
26 697657759802893
27 3861749505389798

List of values

[1, 1, 3, 7, 20, 54, 164, 500, 1630, 5472, 19257, 70132, 265845, 1042187, 4233556, 17747898, 76808746, 342105748, 1567582938, 7371055703, 35543320641, 175391546006, 884988267329, 4558168670317, 23945579145172, 128119583103268, 697657759802893, 3861749505389798]