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.

A293738 Number of multisets of nonempty words with a total of n letters over octonary 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 5471
10 19246
11 70020
12 264961
13 1035540
14 4187725
15 17440159
16 74817905
17 329400093
18 1487844185
19 6873585346
20 32460719143
21 156315314070
22 767106102127
23 3828629444020
24 19423438144438
25 99998608025751
26 522200287437179
27 2762351298913471

List of values

[1, 1, 3, 7, 20, 54, 164, 500, 1630, 5471, 19246, 70020, 264961, 1035540, 4187725, 17440159, 74817905, 329400093, 1487844185, 6873585346, 32460719143, 156315314070, 767106102127, 3828629444020, 19423438144438, 99998608025751, 522200287437179, 2762351298913471]