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.

A293746 Number of sets of nonempty words with a total of n letters over septenary 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 1414
9 4835
10 17143
11 62843
12 238245
13 930418
14 3741710
15 15445815
16 65384356
17 283113205
18 1252393193
19 5648731817
20 25945636702
21 121172059749
22 574764521186
23 2765620022767
24 13486540312370
25 66587056756662
26 332594340605540
27 1679325348600290

List of values

[1, 1, 2, 6, 15, 45, 136, 430, 1414, 4835, 17143, 62843, 238245, 930418, 3741710, 15445815, 65384356, 283113205, 1252393193, 5648731817, 25945636702, 121172059749, 574764521186, 2765620022767, 13486540312370, 66587056756662, 332594340605540, 1679325348600290]