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.

A257741 Number of multisets of nonempty words with a total of n letters over n-ary alphabet such that if a letter occurs in the multiset all predecessors occur at least once.

Table of values

n a(n)
0 1
1 1
2 5
3 30
4 241
5 2356
6 27315
7 364319
8 5488468
9 92040141
10 1698933390
11 34206221161
12 745622368096
13 17486274798203
14 438859174516837
15 11732964019785027
16 332818604033186036
17 9981540739647177238
18 315518234680527952625
19 10482878954868309043158
20 365158449014981632341391

List of values

[1, 1, 5, 30, 241, 2356, 27315, 364319, 5488468, 92040141, 1698933390, 34206221161, 745622368096, 17486274798203, 438859174516837, 11732964019785027, 332818604033186036, 9981540739647177238, 315518234680527952625, 10482878954868309043158, 365158449014981632341391]