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.

A293969 Number of sets of exactly seven 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)
17 1
18 40
19 394
20 2766
21 16251
22 86162
23 426894
24 2021990
25 9290152
26 41829426
27 185965908
28 820999576
29 3615595261
30 15941247432
31 70583512572
32 314664832674
33 1415621796873
34 6439720543682
35 29674662921377
36 138736843637738
37 659019083032289
38 3184439719295586
39 15669157686000028

List of values

[1, 40, 394, 2766, 16251, 86162, 426894, 2021990, 9290152, 41829426, 185965908, 820999576, 3615595261, 15941247432, 70583512572, 314664832674, 1415621796873, 6439720543682, 29674662921377, 138736843637738, 659019083032289, 3184439719295586, 15669157686000028]