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.

A293747 Number of sets 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 2
3 6
4 15
5 45
6 136
7 430
8 1415
9 4844
10 17224
11 63397
12 241968
13 953213
14 3879822
15 16250333
16 70050877
17 309714232
18 1404000641
19 6506809837
20 30813282963
21 148741986670
22 731495853897
23 3657808596354
24 18588011870288
25 95841754173073
26 501169433939670
27 2654344778727646

List of values

[1, 1, 2, 6, 15, 45, 136, 430, 1415, 4844, 17224, 63397, 241968, 953213, 3879822, 16250333, 70050877, 309714232, 1404000641, 6506809837, 30813282963, 148741986670, 731495853897, 3657808596354, 18588011870288, 95841754173073, 501169433939670, 2654344778727646]