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.

A320203 Number of sets of nonempty words with a total of n letters over binary alphabet such that all letters occur at least once in the set.

Table of values

n a(n)
2 3
3 12
4 38
5 110
6 302
7 806
8 2109
9 5450
10 13917
11 35224
12 88464
13 220608
14 546734
15 1347290
16 3302716
17 8057268
18 19568800
19 47329156
20 114025658
21 273709580
22 654765164
23 1561257760
24 3711372761
25 8797021430
26 20794198251
27 49024480496
28 115292809466
29 270495295124
30 633186396954

List of values

[3, 12, 38, 110, 302, 806, 2109, 5450, 13917, 35224, 88464, 220608, 546734, 1347290, 3302716, 8057268, 19568800, 47329156, 114025658, 273709580, 654765164, 1561257760, 3711372761, 8797021430, 20794198251, 49024480496, 115292809466, 270495295124, 633186396954]