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.

A293741 Number of sets of nonempty words with a total of n letters over binary 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 5
4 10
5 23
6 51
7 111
8 243
9 530
10 1156
11 2497
12 5421
13 11662
14 25179
15 53991
16 116035
17 248025
18 531045
19 1131943
20 2415495
21 5135914
22 10927905
23 23182313
24 49199819
25 104154950
26 220543471
27 465997148
28 984704560
29 2076988713
30 4380764650
31 9225209928
32 19424814305

List of values

[1, 1, 2, 5, 10, 23, 51, 111, 243, 530, 1156, 2497, 5421, 11662, 25179, 53991, 116035, 248025, 531045, 1131943, 2415495, 5135914, 10927905, 23182313, 49199819, 104154950, 220543471, 465997148, 984704560, 2076988713, 4380764650, 9225209928, 19424814305]