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.

A293748 Number of sets of nonempty words with a total of n letters over nonary 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)
0 1
1 1
2 2
3 6
4 15
5 45
6 136
7 430
8 1415
9 4845
10 17234
11 63497
12 242720
13 958754
14 3916799
15 16493831
16 71586602
17 319336319
18 1463096806
19 6869041635
20 33014439494
21 162130576595
22 812715417240
23 4151894763819
24 21595739171153
25 114222733829429
26 613789962584588
27 3347502798880170

List of values

[1, 1, 2, 6, 15, 45, 136, 430, 1415, 4845, 17234, 63497, 242720, 958754, 3916799, 16493831, 71586602, 319336319, 1463096806, 6869041635, 33014439494, 162130576595, 812715417240, 4151894763819, 21595739171153, 114222733829429, 613789962584588, 3347502798880170]