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.

A293967 Number of sets of exactly five 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)
11 6
12 48
13 274
14 1338
15 6035
16 25874
17 108002
18 444458
19 1818905
20 7451418
21 30693022
22 127604480
23 536876960
24 2291507552
25 9939572897
26 43885543586
27 197465168488
28 906430558822
29 4247727231198
30 20333276583188
31 99450038211268
32 497066503157976
33 2538584563166367

List of values

[6, 48, 274, 1338, 6035, 25874, 108002, 444458, 1818905, 7451418, 30693022, 127604480, 536876960, 2291507552, 9939572897, 43885543586, 197465168488, 906430558822, 4247727231198, 20333276583188, 99450038211268, 497066503157976, 2538584563166367]