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.

A340413 Number of sets of nonempty words with a total of n letters over senary alphabet such that within each 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 13
4 60
5 326
6 2065
7 9468
8 51325
9 268339
10 1534485
11 8421447
12 51259855
13 271291165
14 1568129440
15 8793678911
16 51467662027
17 290934776639
18 1758652551885
19 9783478684069
20 57676281958781
21 331610976485751
22 1959129522047734
23 11269354282135629
24 67953764278371963

List of values

[1, 1, 3, 13, 60, 326, 2065, 9468, 51325, 268339, 1534485, 8421447, 51259855, 271291165, 1568129440, 8793678911, 51467662027, 290934776639, 1758652551885, 9783478684069, 57676281958781, 331610976485751, 1959129522047734, 11269354282135629, 67953764278371963]