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.

A293970 Number of sets of exactly eight 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)
21 10
22 206
23 1926
24 13957
25 85610
26 476631
27 2477550
28 12289388
29 58942808
30 276126959
31 1272626168
32 5803545269
33 26305047510
34 118947441994
35 538263144030
36 2444159610896
37 11163194878438
38 51392032544011
39 238939873029462
40 1123916805738119
41 5357138152220234
42 25913264903132961

List of values

[10, 206, 1926, 13957, 85610, 476631, 2477550, 12289388, 58942808, 276126959, 1272626168, 5803545269, 26305047510, 118947441994, 538263144030, 2444159610896, 11163194878438, 51392032544011, 238939873029462, 1123916805738119, 5357138152220234, 25913264903132961]