A228892 - cp's OEIS frontend

A228892 Triangular array read by rows. T(n,k) is the number of 2-colored labeled graphs on n nodes with exactly k connected components; n>=1, 1<=k<=n.

n	a(n)
1	2
2	2
3	4
4	6
5	12
6	8
7	38
8	60
9	48
10	16
11	390
12	500
13	360
14	160
15	32
16	6062
17	6180
18	3840
19	1680
20	480
21	64
22	134526
23	109228
24	56280
25	22400
26	6720
27	1344
28	128
29	4172198
30	2673468
31	1120784
32	384720
33	109760
34	24192
35	3584
36	256
37	178449270
38	89708004
39	29975400
40	8579424
41	2187360
42	475776
43	80640
44	9216
45	512
46	10508108222
47	4108881300

[2, 2, 4, 6, 12, 8, 38, 60, 48, 16, 390, 500, 360, 160, 32, 6062, 6180, 3840, 1680, 480, 64, 134526, 109228, 56280, 22400, 6720, 1344, 128, 4172198, 2673468, 1120784, 384720, 109760, 24192, 3584, 256, 178449270, 89708004, 29975400, 8579424, 2187360, 475776, 80640, 9216, 512, 10508108222, 4108881300]

cp's OEIS Frontend

A228892 Triangular array read by rows. T(n,k) is the number of 2-colored labeled graphs on n nodes with exactly k connected components; n>=1, 1<=k<=n.

Table of values

List of values