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.

A003469 Number of minimal covers of an (n + 1)-set by a collection of n nonempty subsets, a(n) = A035348(n,n-1).

Table of values

n a(n)
1 1
2 6
3 22
4 65
5 171
6 420
7 988
8 2259
9 5065
10 11198
11 24498
12 53157
13 114583
14 245640
15 524152
16 1113959
17 2359125
18 4980546
19 10485550
20 22019865
21 46137091
22 96468716
23 201326292
24 419430075
25 872414881
26 1811938950
27 3758095978
28 7784627789
29 16106126895
30 33285996048

List of values

[1, 6, 22, 65, 171, 420, 988, 2259, 5065, 11198, 24498, 53157, 114583, 245640, 524152, 1113959, 2359125, 4980546, 10485550, 22019865, 46137091, 96468716, 201326292, 419430075, 872414881, 1811938950, 3758095978, 7784627789, 16106126895, 33285996048]