A228859 - cp's OEIS frontend

A228859 Triangular array read by rows. T(n,k) is the number of labeled bipartite graphs on n nodes having exactly k connected components; n>=1, 1<=k<=n.

n	a(n)
1	1
2	1
3	1
4	3
5	3
6	1
7	19
8	15
9	6
10	1
11	195
12	125
13	45
14	10
15	1
16	3031
17	1545
18	480
19	105
20	15
21	1
22	67263
23	27307
24	7035
25	1400
26	210
27	21
28	1
29	2086099
30	668367
31	140098
32	24045
33	3430
34	378
35	28
36	1
37	89224635
38	22427001
39	3746925
40	536214
41	68355
42	7434
43	630
44	36
45	1

[1, 1, 1, 3, 3, 1, 19, 15, 6, 1, 195, 125, 45, 10, 1, 3031, 1545, 480, 105, 15, 1, 67263, 27307, 7035, 1400, 210, 21, 1, 2086099, 668367, 140098, 24045, 3430, 378, 28, 1, 89224635, 22427001, 3746925, 536214, 68355, 7434, 630, 36, 1]

cp's OEIS Frontend

A228859 Triangular array read by rows. T(n,k) is the number of labeled bipartite graphs on n nodes having exactly k connected components; n>=1, 1<=k<=n.

Table of values

List of values