A328888 - cp's OEIS frontend

A328888 Array read by antidiagonals: T(n,m) is the number of acyclic edge covers of the complete bipartite graph K_{n,m}.

n	a(n)
1	1
2	1
3	1
4	1
5	6
6	1
7	1
8	18
9	18
10	1
11	1
12	46
13	132
14	46
15	1
16	1
17	110
18	696
19	696
20	110
21	1
22	1
23	254
24	3150
25	6728
26	3150
27	254
28	1
29	1
30	574
31	13086
32	51760
33	51760
34	13086
35	574
36	1
37	1
38	1278
39	51492
40	348048
41	632970
42	348048
43	51492
44	1278
45	1
46	1
47	2814
48	195180
49	2143736
50	6466980
51	6466980
52	2143736
53	195180
54	2814
55	1

[1, 1, 1, 1, 6, 1, 1, 18, 18, 1, 1, 46, 132, 46, 1, 1, 110, 696, 696, 110, 1, 1, 254, 3150, 6728, 3150, 254, 1, 1, 574, 13086, 51760, 51760, 13086, 574, 1, 1, 1278, 51492, 348048, 632970, 348048, 51492, 1278, 1, 1, 2814, 195180, 2143736, 6466980, 6466980, 2143736, 195180, 2814, 1]

cp's OEIS Frontend

A328888 Array read by antidiagonals: T(n,m) is the number of acyclic edge covers of the complete bipartite graph K_{n,m}.

Table of values

List of values