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.

A340414 Number of sets of nonempty words with a total of n letters over septenary alphabet such that within each 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 3
3 13
4 60
5 326
6 2065
7 14508
8 76525
9 454819
10 2718885
11 16777767
12 107808655
13 697287805
14 4748992600
15 29397584111
16 190989109387
17 1239766891439
18 8159345112885
19 54161955000133
20 360150593097845
21 2454684519628143
22 16056425089104526
23 107300319826659573

List of values

[1, 1, 3, 13, 60, 326, 2065, 14508, 76525, 454819, 2718885, 16777767, 107808655, 697287805, 4748992600, 29397584111, 190989109387, 1239766891439, 8159345112885, 54161955000133, 360150593097845, 2454684519628143, 16056425089104526, 107300319826659573]