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.

A035347 Triangle of a(n,k) = number of minimal covers of an n-set that cover k points of that set uniquely (n >= 1, k >= 1).

Table of values

n a(n)
1 1
2 0
3 2
4 0
5 3
6 5
7 0
8 6
9 28
10 15
11 0
12 10
13 190
14 210
15 52
16 0
17 15
18 1340
19 3360
20 1506
21 203
22 0
23 21
24 9065
25 60270
26 48321
27 10871
28 877
29 0
30 28
31 57512
32 1132880
33 1820056
34 636300
35 80592
36 4140
37 0
38 36
39 344316
40 21067452
41 76834926
42 45455676
43 8081928
44 618939
45 21147
46 0
47 45

List of values

[1, 0, 2, 0, 3, 5, 0, 6, 28, 15, 0, 10, 190, 210, 52, 0, 15, 1340, 3360, 1506, 203, 0, 21, 9065, 60270, 48321, 10871, 877, 0, 28, 57512, 1132880, 1820056, 636300, 80592, 4140, 0, 36, 344316, 21067452, 76834926, 45455676, 8081928, 618939, 21147, 0, 45]