A111636 - cp's OEIS frontend

A111636 Triangle read by rows: T(n,k) (0<=k<=n) is the number of labeled graphs having k blue nodes and n-k green ones and only nodes of different colors can be joined by an edge.

n	a(n)
0	1
1	1
2	1
3	1
4	4
5	1
6	1
7	12
8	12
9	1
10	1
11	32
12	96
13	32
14	1
15	1
16	80
17	640
18	640
19	80
20	1
21	1
22	192
23	3840
24	10240
25	3840
26	192
27	1
28	1
29	448
30	21504
31	143360
32	143360
33	21504
34	448
35	1
36	1
37	1024
38	114688
39	1835008
40	4587520
41	1835008
42	114688
43	1024
44	1
45	1
46	2304
47	589824
48	22020096
49	132120576
50	132120576
51	22020096
52	589824
53	2304
54	1

[1, 1, 1, 1, 4, 1, 1, 12, 12, 1, 1, 32, 96, 32, 1, 1, 80, 640, 640, 80, 1, 1, 192, 3840, 10240, 3840, 192, 1, 1, 448, 21504, 143360, 143360, 21504, 448, 1, 1, 1024, 114688, 1835008, 4587520, 1835008, 114688, 1024, 1, 1, 2304, 589824, 22020096, 132120576, 132120576, 22020096, 589824, 2304, 1]

cp's OEIS Frontend

A111636 Triangle read by rows: T(n,k) (0<=k<=n) is the number of labeled graphs having k blue nodes and n-k green ones and only nodes of different colors can be joined by an edge.

Table of values

List of values