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.

A293114 Number of sets of nonempty words with a total of n letters over n-ary 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 2
3 6
4 15
5 45
6 136
7 430
8 1415
9 4845
10 17235
11 63509
12 242854
13 959904
14 3926209
15 16564083
16 72097127
17 322898943
18 1487602607
19 7034420691
20 34122991199
21 169499127425
22 861596397518
23 4475340840980
24 23738200183570
25 128427236055296
26 708248486616539
27 3977551340260517

List of values

[1, 1, 2, 6, 15, 45, 136, 430, 1415, 4845, 17235, 63509, 242854, 959904, 3926209, 16564083, 72097127, 322898943, 1487602607, 7034420691, 34122991199, 169499127425, 861596397518, 4475340840980, 23738200183570, 128427236055296, 708248486616539, 3977551340260517]