A201143 - cp's OEIS frontend

A201143 Irregular triangular array read by rows T(n,k) is the number of 2-colored labeled graphs that have exactly k edges, n >= 2, 0 <= k <= A033638(n).

n	a(n)
2	1
3	1
4	3
5	6
6	3
7	7
8	24
9	30
10	16
11	3
12	15
13	80
14	180
15	220
16	155
17	60
18	10
19	31
20	240
21	840
22	1740
23	2340
24	2106
25	1260
26	480
27	105
28	10
29	63
30	672
31	3360
32	10360
33	21840
34	33054
35	36757
36	30240
37	18270
38	7910
39	2331
40	420
41	35
42	127
43	1792
44	12096
45	51520
46	154280
47	343392
48	586488
49	782944
50	824670
51	686840
52	450296
53	229656
54	89208
55	25480
56	5040
57	616
58	35

[1, 1, 3, 6, 3, 7, 24, 30, 16, 3, 15, 80, 180, 220, 155, 60, 10, 31, 240, 840, 1740, 2340, 2106, 1260, 480, 105, 10, 63, 672, 3360, 10360, 21840, 33054, 36757, 30240, 18270, 7910, 2331, 420, 35, 127, 1792, 12096, 51520, 154280, 343392, 586488, 782944, 824670, 686840, 450296, 229656, 89208, 25480, 5040, 616, 35]

cp's OEIS Frontend

A201143 Irregular triangular array read by rows T(n,k) is the number of 2-colored labeled graphs that have exactly k edges, n >= 2, 0 <= k <= A033638(n).

Table of values

List of values