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.

A293971 Number of sets 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)
25 45
26 740
27 7265
28 54844
29 355786
30 2086218
31 11402599
32 59244154
33 296592681
34 1444795518
35 6898985716
36 32478508414
37 151439118998
38 702039301562
39 3246061184641
40 15011635714770
41 69604533115983
42 324297338323040
43 1521325113273431
44 7199243859471728
45 34426802099939524

List of values

[45, 740, 7265, 54844, 355786, 2086218, 11402599, 59244154, 296592681, 1444795518, 6898985716, 32478508414, 151439118998, 702039301562, 3246061184641, 15011635714770, 69604533115983, 324297338323040, 1521325113273431, 7199243859471728, 34426802099939524]