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.

A294005 Number of multisets of exactly three 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)
3 1
4 2
5 7
6 22
7 68
8 218
9 721
10 2438
11 8491
12 30478
13 112524
14 428382
15 1678600
16 6778708
17 28169286
18 120516092
19 530081370
20 2396797920
21 11125584584
22 52993063796
23 258676491628
24 1293160049244
25 6612750833996
26 34564483264256
27 184470133103464
28 1004514566402816

List of values

[1, 2, 7, 22, 68, 218, 721, 2438, 8491, 30478, 112524, 428382, 1678600, 6778708, 28169286, 120516092, 530081370, 2396797920, 11125584584, 52993063796, 258676491628, 1293160049244, 6612750833996, 34564483264256, 184470133103464, 1004514566402816]