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.

A293732 Number of multisets 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 3
3 6
4 15
5 31
6 73
7 155
8 351
9 755
10 1673
11 3604
12 7897
13 16988
14 36902
15 79222
16 171030
17 366180
18 786746
19 1679976
20 3595207
21 7657631
22 16332935
23 34706319
24 73812099
25 156503351
26 332004423
27 702533059
28 1486998780
29 3140716766
30 6634315264
31 13988517803
32 29494816751

List of values

[1, 1, 3, 6, 15, 31, 73, 155, 351, 755, 1673, 3604, 7897, 16988, 36902, 79222, 171030, 366180, 786746, 1679976, 3595207, 7657631, 16332935, 34706319, 73812099, 156503351, 332004423, 702533059, 1486998780, 3140716766, 6634315264, 13988517803, 29494816751]