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.

A294011 Number of multisets of exactly nine 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)
9 1
10 2
11 7
12 22
13 73
14 240
15 818
16 2824
17 10004
18 36252
19 134583
20 512580
21 2002550
22 8036582
23 33117812
24 140269222
25 610272640
26 2728310488
27 12523401416
28 59010337316
29 285150731417
30 1412280452528
31 7161224109072
32 37149235934192
33 196939443174176
34 1066080526789082

List of values

[1, 2, 7, 22, 73, 240, 818, 2824, 10004, 36252, 134583, 512580, 2002550, 8036582, 33117812, 140269222, 610272640, 2728310488, 12523401416, 59010337316, 285150731417, 1412280452528, 7161224109072, 37149235934192, 196939443174176, 1066080526789082]