A281269 - cp's OEIS frontend

A281269 Triangle read by rows: T(n,k) is the number of edge covers of the complete labeled graph on n nodes that are minimal and have exactly k edges, n>=2, 1<=k<=n-1.

n	a(n)
2	1
3	0
4	3
5	0
6	3
7	4
8	0
9	0
10	30
11	5
12	0
13	0
14	15
15	150
16	6
17	0
18	0
19	0
20	315
21	525
22	7
23	0
24	0
25	0
26	105
27	3360
28	1568
29	8
30	0
31	0
32	0
33	0
34	3780
35	24570
36	4284
37	9
38	0
39	0
40	0
41	0
42	945
43	69300
44	142380
45	11070
46	10
47	0
48	0
49	0
50	0
51	0
52	51975
53	866250
54	713790
55	27555
56	11
57	0
58	0
59	0
60	0
61	0
62	10395
63	1455300
64	8399160
65	3250500
66	66792
67	12

[1, 0, 3, 0, 3, 4, 0, 0, 30, 5, 0, 0, 15, 150, 6, 0, 0, 0, 315, 525, 7, 0, 0, 0, 105, 3360, 1568, 8, 0, 0, 0, 0, 3780, 24570, 4284, 9, 0, 0, 0, 0, 945, 69300, 142380, 11070, 10, 0, 0, 0, 0, 0, 51975, 866250, 713790, 27555, 11, 0, 0, 0, 0, 0, 10395, 1455300, 8399160, 3250500, 66792, 12]

cp's OEIS Frontend

A281269 Triangle read by rows: T(n,k) is the number of edge covers of the complete labeled graph on n nodes that are minimal and have exactly k edges, n>=2, 1<=k<=n-1.

Table of values

List of values