A328887 - cp's OEIS frontend

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

n	a(n)
0	1
1	1
2	1
3	1
4	2
5	1
6	1
7	4
8	4
9	1
10	1
11	8
12	15
13	8
14	1
15	1
16	16
17	54
18	54
19	16
20	1
21	1
22	32
23	189
24	328
25	189
26	32
27	1
28	1
29	64
30	648
31	1856
32	1856
33	648
34	64
35	1
36	1
37	128
38	2187
39	9984
40	16145
41	9984
42	2187
43	128
44	1
45	1
46	256
47	7290
48	51712
49	129000
50	129000
51	51712
52	7290
53	256
54	1
55	1
56	512
57	24057
58	260096
59	968125
60	1475856
61	968125
62	260096
63	24057
64	512
65	1

[1, 1, 1, 1, 2, 1, 1, 4, 4, 1, 1, 8, 15, 8, 1, 1, 16, 54, 54, 16, 1, 1, 32, 189, 328, 189, 32, 1, 1, 64, 648, 1856, 1856, 648, 64, 1, 1, 128, 2187, 9984, 16145, 9984, 2187, 128, 1, 1, 256, 7290, 51712, 129000, 129000, 51712, 7290, 256, 1, 1, 512, 24057, 260096, 968125, 1475856, 968125, 260096, 24057, 512, 1]

cp's OEIS Frontend

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

Table of values

List of values