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.

A293883 Number of sets of nonempty words with a total of n letters over binary alphabet containing the second letter 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)
2 1
3 3
4 8
5 20
6 47
7 106
8 237
9 522
10 1146
11 2485
12 5406
13 11644
14 25157
15 53964
16 116003
17 247987
18 530999
19 1131889
20 2415431
21 5135838
22 10927816
23 23182209
24 49199697
25 104154808
26 220543306
27 465996956
28 984704338
29 2076988457
30 4380764354
31 9225209588
32 19424813915
33 40844509107

List of values

[1, 3, 8, 20, 47, 106, 237, 522, 1146, 2485, 5406, 11644, 25157, 53964, 116003, 247987, 530999, 1131889, 2415431, 5135838, 10927816, 23182209, 49199697, 104154808, 220543306, 465996956, 984704338, 2076988457, 4380764354, 9225209588, 19424813915, 40844509107]