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.

A293968 Number of sets of exactly six 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)
14 4
15 62
16 417
17 2414
18 12190
19 57686
20 260349
21 1143710
22 4936266
23 21117128
24 90035798
25 384416432
26 1649398948
27 7133455202
28 31173583589
29 137947781614
30 619247938106
31 2824375268432
32 13105785174035
33 61940904739132
34 298438345898409
35 1466892183248186
36 7358885205363735

List of values

[4, 62, 417, 2414, 12190, 57686, 260349, 1143710, 4936266, 21117128, 90035798, 384416432, 1649398948, 7133455202, 31173583589, 137947781614, 619247938106, 2824375268432, 13105785174035, 61940904739132, 298438345898409, 1466892183248186, 7358885205363735]