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.

A340417 Number of sets of nonempty words with a total of n letters over denary 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 116845
9 1039459
10 10339365
11 72459687
12 581246095
13 4483235005
14 36697945720
15 298344453071
16 2601248199787
17 22469318990159
18 208007606797845
19 1867498245975013
20 17978675539264085
21 153181998023380623
22 1392447676785436846

List of values

[1, 1, 3, 13, 60, 326, 2065, 14508, 116845, 1039459, 10339365, 72459687, 581246095, 4483235005, 36697945720, 298344453071, 2601248199787, 22469318990159, 208007606797845, 1867498245975013, 17978675539264085, 153181998023380623, 1392447676785436846]