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.

A056885 Triangle T(n,k) = number of minimal covers of an unlabeled n-set that cover k points of that set uniquely, k=0..n.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 0
5 2
6 0
7 0
8 1
9 3
10 0
11 0
12 1
13 3
14 5
15 0
16 0
17 1
18 5
19 8
20 7
21 0
22 0
23 1
24 8
25 19
26 17
27 11
28 0
29 0
30 1
31 12
32 45
33 56
34 35
35 15
36 0
37 0
38 1
39 17
40 107
41 194
42 151
43 65
44 22
45 0
46 0
47 1
48 24
49 244
50 713
51 728
52 365
53 118
54 30
55 0
56 0
57 1
58 32
59 547
60 2697
61 3996
62 2413
63 835
64 203
65 42
66 0
67 0
68 1
69 42
70 1173
71 10356
72 24446

List of values

[1, 0, 1, 0, 0, 2, 0, 0, 1, 3, 0, 0, 1, 3, 5, 0, 0, 1, 5, 8, 7, 0, 0, 1, 8, 19, 17, 11, 0, 0, 1, 12, 45, 56, 35, 15, 0, 0, 1, 17, 107, 194, 151, 65, 22, 0, 0, 1, 24, 244, 713, 728, 365, 118, 30, 0, 0, 1, 32, 547, 2697, 3996, 2413, 835, 203, 42, 0, 0, 1, 42, 1173, 10356, 24446]