A106498 - cp's OEIS frontend

A106498 Triangle read by rows: T(n,k) = number of unlabeled bicolored graphs with isolated nodes allowed having 2n nodes and k edges, with n nodes of each color. Here n >= 0, 0 <= k <= n^2.

n	a(n)
0	1
1	1
2	1
3	1
4	1
5	2
6	1
7	1
8	1
9	1
10	2
11	4
12	5
13	5
14	4
15	2
16	1
17	1
18	1
19	1
20	2
21	4
22	10
23	13
24	23
25	26
26	32
27	26
28	23
29	13
30	10
31	4
32	2
33	1
34	1
35	1
36	1
37	2
38	4
39	10
40	20
41	39
42	72
43	128
44	198
45	280
46	353
47	399
48	399
49	353
50	280
51	198
52	128
53	72
54	39
55	20
56	10
57	4
58	2
59	1
60	1
61	1
62	1
63	2
64	4
65	10
66	20
67	50
68	99
69	227
70	458
71	934
72	1711

[1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 4, 5, 5, 4, 2, 1, 1, 1, 1, 2, 4, 10, 13, 23, 26, 32, 26, 23, 13, 10, 4, 2, 1, 1, 1, 1, 2, 4, 10, 20, 39, 72, 128, 198, 280, 353, 399, 399, 353, 280, 198, 128, 72, 39, 20, 10, 4, 2, 1, 1, 1, 1, 2, 4, 10, 20, 50, 99, 227, 458, 934, 1711]

cp's OEIS Frontend

A106498 Triangle read by rows: T(n,k) = number of unlabeled bicolored graphs with isolated nodes allowed having 2n nodes and k edges, with n nodes of each color. Here n >= 0, 0 <= k <= n^2.

Table of values

List of values