A282575 - cp's OEIS frontend

A282575 Triangular array read by rows. T(n,k) is the number of minimal covers of an n-set with exactly k points that are in more than one set of the cover, n>=0, 0<=k<=max(0,n-2).

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

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

cp's OEIS Frontend

A282575 Triangular array read by rows. T(n,k) is the number of minimal covers of an n-set with exactly k points that are in more than one set of the cover, n>=0, 0<=k<=max(0,n-2).

Table of values

List of values