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.

A340409 Number of sets of nonempty words with a total of n letters over binary 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 7
4 18
5 42
6 110
7 250
8 627
9 1439
10 3523
11 8063
12 19374
13 44274
14 104816
15 238976
16 559171
17 1271295
18 2946901
19 6679741
20 15363719
21 34719631
22 79335385
23 178749829
24 406164359
25 912475815
26 2063298409
27 4622461673
28 10407679805
29 23254807241
30 52160338735
31 116252939071

List of values

[1, 1, 3, 7, 18, 42, 110, 250, 627, 1439, 3523, 8063, 19374, 44274, 104816, 238976, 559171, 1271295, 2946901, 6679741, 15363719, 34719631, 79335385, 178749829, 406164359, 912475815, 2063298409, 4622461673, 10407679805, 23254807241, 52160338735, 116252939071]