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.

A293115 Number of sets of nonempty words with a total of 2n letters over n-ary alphabet containing the n-th letter 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 8
3 53
4 410
5 3576
6 35878
7 391136
8 4666521
9 59096165
10 797628339
11 11282268353
12 167582833398
13 2587994886476
14 41585338511800
15 690912445945576
16 11870082701946292
17 209995330141487944
18 3824511903396303251
19 71496027436457015058
20 1371314535020854180410

List of values

[1, 1, 8, 53, 410, 3576, 35878, 391136, 4666521, 59096165, 797628339, 11282268353, 167582833398, 2587994886476, 41585338511800, 690912445945576, 11870082701946292, 209995330141487944, 3824511903396303251, 71496027436457015058, 1371314535020854180410]