A122083 - cp's OEIS frontend

A122083 Triangle read by rows in which row n gives the number of unlabeled bicolored graphs having k nodes of one color and n-k nodes of the other color, with no isolated nodes; the color classes are not interchangeable.

n	a(n)
0	1
1	0
2	0
3	0
4	1
5	0
6	0
7	1
8	1
9	0
10	0
11	1
12	3
13	1
14	0
15	0
16	1
17	5
18	5
19	1
20	0
21	0
22	1
23	8
24	17
25	8
26	1
27	0
28	0
29	1
30	11
31	42
32	42
33	11
34	1
35	0
36	0
37	1
38	15
39	91
40	179
41	91
42	15
43	1
44	0
45	0
46	1
47	19
48	180
49	633
50	633
51	180
52	19
53	1
54	0
55	0
56	1
57	24
58	328
59	2001
60	3835
61	2001
62	328
63	24
64	1
65	0
66	0
67	1
68	29
69	565
70	5745
71	20755
72	20755

[1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 3, 1, 0, 0, 1, 5, 5, 1, 0, 0, 1, 8, 17, 8, 1, 0, 0, 1, 11, 42, 42, 11, 1, 0, 0, 1, 15, 91, 179, 91, 15, 1, 0, 0, 1, 19, 180, 633, 633, 180, 19, 1, 0, 0, 1, 24, 328, 2001, 3835, 2001, 328, 24, 1, 0, 0, 1, 29, 565, 5745, 20755, 20755]

cp's OEIS Frontend

A122083 Triangle read by rows in which row n gives the number of unlabeled bicolored graphs having k nodes of one color and n-k nodes of the other color, with no isolated nodes; the color classes are not interchangeable.

Table of values

List of values