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.

A293736 Number of multisets of nonempty words with a total of n letters over senary 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)
0 1
1 1
2 3
3 7
4 20
5 54
6 164
7 499
8 1621
9 5397
10 18762
11 67000
12 247439
13 936167
14 3639968
15 14450634
16 58677742
17 242511781
18 1021307520
19 4365923278
20 18960435664
21 83395216882
22 371734296357
23 1675125941350
24 7635063496721
25 35127842511275
26 163213032700613
27 764541230737345

List of values

[1, 1, 3, 7, 20, 54, 164, 499, 1621, 5397, 18762, 67000, 247439, 936167, 3639968, 14450634, 58677742, 242511781, 1021307520, 4365923278, 18960435664, 83395216882, 371734296357, 1675125941350, 7635063496721, 35127842511275, 163213032700613, 764541230737345]