A187152 - cp's OEIS frontend

A187152 Triangle T(m,n), read by rows: Number of bipartite labeled graphs (V,E) with vertices A={a_1,...,a_m} and B={b_1,...,b_n} where for any vertex in V at most one edge in E is allowed. Additionally, an edge {a_k,b_l} is allowed only when |k-l|<=1.

n	a(n)
1	2
2	3
3	7
4	3
5	10
6	22
7	3
8	10
9	32
10	71
11	3
12	10
13	32
14	103
15	228
16	3
17	10
18	32
19	103
20	331
21	733
22	3
23	10
24	32
25	103
26	331
27	1064
28	2356
29	3
30	10
31	32
32	103
33	331
34	1064
35	3420
36	7573
37	3
38	10
39	32
40	103
41	331
42	1064
43	3420
44	10993
45	24342
46	3
47	10
48	32
49	103
50	331
51	1064
52	3420
53	10993
54	35335
55	78243

[2, 3, 7, 3, 10, 22, 3, 10, 32, 71, 3, 10, 32, 103, 228, 3, 10, 32, 103, 331, 733, 3, 10, 32, 103, 331, 1064, 2356, 3, 10, 32, 103, 331, 1064, 3420, 7573, 3, 10, 32, 103, 331, 1064, 3420, 10993, 24342, 3, 10, 32, 103, 331, 1064, 3420, 10993, 35335, 78243]

cp's OEIS Frontend

A187152 Triangle T(m,n), read by rows: Number of bipartite labeled graphs (V,E) with vertices A={a_1,...,a_m} and B={b_1,...,b_n} where for any vertex in V at most one edge in E is allowed. Additionally, an edge {a_k,b_l} is allowed only when |k-l|<=1.

Table of values

List of values