A293745 - cp's OEIS frontend

A293745 Number of sets 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.

n	a(n)
0	1
1	1
2	2
3	6
4	15
5	45
6	136
7	429
8	1406
9	4771
10	16749
11	60453
12	224948
13	857010
14	3350574
15	13366375
16	54494538
17	226020624
18	954737292
19	4092229831
20	17813005015
21	78509835288
22	350592604663
23	1582430253294
24	7223028969003
25	33275812688050
26	154790795962448
27	725871751770492

[1, 1, 2, 6, 15, 45, 136, 429, 1406, 4771, 16749, 60453, 224948, 857010, 3350574, 13366375, 54494538, 226020624, 954737292, 4092229831, 17813005015, 78509835288, 350592604663, 1582430253294, 7223028969003, 33275812688050, 154790795962448, 725871751770492]

cp's OEIS Frontend

A293745 Number of sets 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

List of values