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.

A293972 Number of sets of exactly ten 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)
29 120
30 2010
31 21082
32 169846
33 1173098
34 7286181
35 41993502
36 228997683
37 1198101638
38 6074435686
39 30073235682
40 146248264684
41 701957684114
42 3338454463793
43 15784582285468
44 74407037119692
45 350575594435412
46 1654700449779204
47 7840223330719670
48 37363522942015498

List of values

[120, 2010, 21082, 169846, 1173098, 7286181, 41993502, 228997683, 1198101638, 6074435686, 30073235682, 146248264684, 701957684114, 3338454463793, 15784582285468, 74407037119692, 350575594435412, 1654700449779204, 7840223330719670, 37363522942015498]