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.

A340416 Number of sets of nonempty words with a total of n letters over nonary 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 3
3 13
4 60
5 326
6 2065
7 14508
8 116845
9 1039459
10 6710565
11 48872487
12 350817295
13 2619846205
14 20019859960
15 158415989711
16 1300359929707
17 10644485545679
18 91963547963925
19 715052566412773
20 5842504427274965
21 47435773495721103
22 390005026265914606
23 3225674439739003413

List of values

[1, 1, 3, 13, 60, 326, 2065, 14508, 116845, 1039459, 6710565, 48872487, 350817295, 2619846205, 20019859960, 158415989711, 1300359929707, 10644485545679, 91963547963925, 715052566412773, 5842504427274965, 47435773495721103, 390005026265914606, 3225674439739003413]