A228890 - cp's OEIS frontend

A228890 Triangular array read by rows. T(n,k) is the number of 2-colored labeled graphs on n nodes with exactly k edges; n >= 0, 0 <= k <= A002620(n).

n	a(n)
0	1
1	2
2	4
3	2
4	8
5	12
6	6
7	16
8	48
9	60
10	32
11	6
12	32
13	160
14	360
15	440
16	310
17	120
18	20
19	64
20	480
21	1680
22	3480
23	4680
24	4212
25	2520
26	960
27	210
28	20
29	128
30	1344
31	6720
32	20720
33	43680
34	66108
35	73514
36	60480
37	36540
38	15820
39	4662
40	840
41	70
42	256
43	3584
44	24192
45	103040
46	308560
47	686784
48	1172976
49	1565888
50	1649340
51	1373680
52	900592
53	459312
54	178416
55	50960
56	10080
57	1232
58	70

[1, 2, 4, 2, 8, 12, 6, 16, 48, 60, 32, 6, 32, 160, 360, 440, 310, 120, 20, 64, 480, 1680, 3480, 4680, 4212, 2520, 960, 210, 20, 128, 1344, 6720, 20720, 43680, 66108, 73514, 60480, 36540, 15820, 4662, 840, 70, 256, 3584, 24192, 103040, 308560, 686784, 1172976, 1565888, 1649340, 1373680, 900592, 459312, 178416, 50960, 10080, 1232, 70]

cp's OEIS Frontend

A228890 Triangular array read by rows. T(n,k) is the number of 2-colored labeled graphs on n nodes with exactly k edges; n >= 0, 0 <= k <= A002620(n).

Table of values

List of values