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.

A293739 Number of multisets of nonempty words with a total of n letters over nonary 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 19256
11 70121
12 265723
13 1041184
14 4225484
15 17689505
16 76392933
17 339283021
18 1548592471
19 7246210567
20 34725853445
21 170096822940
22 850715642495
23 4337263437693
24 22519434992230
25 118916581795167
26 638088881489144
27 3475474084479428

List of values

[1, 1, 3, 7, 20, 54, 164, 500, 1630, 5472, 19256, 70121, 265723, 1041184, 4225484, 17689505, 76392933, 339283021, 1548592471, 7246210567, 34725853445, 170096822940, 850715642495, 4337263437693, 22519434992230, 118916581795167, 638088881489144, 3475474084479428]