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.

A293742 Number of sets of nonempty words with a total of n letters over ternary 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 14
5 39
6 104
7 284
8 775
9 2145
10 5941
11 16563
12 46329
13 130100
14 366432
15 1035191
16 2931797
17 8323290
18 23680142
19 67505721
20 192791938
21 551537506
22 1580315319
23 4534715008
24 13030197881
25 37489497472
26 107991978290
27 311433926717
28 899093131819
29 2598257241179

List of values

[1, 1, 2, 6, 14, 39, 104, 284, 775, 2145, 5941, 16563, 46329, 130100, 366432, 1035191, 2931797, 8323290, 23680142, 67505721, 192791938, 551537506, 1580315319, 4534715008, 13030197881, 37489497472, 107991978290, 311433926717, 899093131819, 2598257241179]