A228861 - cp's OEIS frontend

A228861 Irregular triangular array read by rows. T(n,k) is the number of connected labeled bipartite graphs on n nodes with exactly k edges; n >= 1, 0 <= k <= A002620(n+1).

n	a(n)
1	1
2	0
3	1
4	0
5	0
6	3
7	0
8	0
9	0
10	16
11	3
12	0
13	0
14	0
15	0
16	125
17	60
18	10
19	0
20	0
21	0
22	0
23	0
24	1296
25	1140
26	480
27	105
28	10
29	0
30	0
31	0
32	0
33	0
34	0
35	16807
36	23100
37	16800
38	7770
39	2331
40	420
41	35
42	0
43	0
44	0
45	0
46	0
47	0
48	0
49	262144
50	513240
51	555520
52	412440
53	222936
54	88648
55	25480
56	5040
57	616
58	35

[1, 0, 1, 0, 0, 3, 0, 0, 0, 16, 3, 0, 0, 0, 0, 125, 60, 10, 0, 0, 0, 0, 0, 1296, 1140, 480, 105, 10, 0, 0, 0, 0, 0, 0, 16807, 23100, 16800, 7770, 2331, 420, 35, 0, 0, 0, 0, 0, 0, 0, 262144, 513240, 555520, 412440, 222936, 88648, 25480, 5040, 616, 35]

cp's OEIS Frontend

A228861 Irregular triangular array read by rows. T(n,k) is the number of connected labeled bipartite graphs on n nodes with exactly k edges; n >= 1, 0 <= k <= A002620(n+1).

Table of values

List of values