A322279 - cp's OEIS frontend

A322279 Array read by antidiagonals: T(n,k) is the number of connected graphs on n labeled nodes, each node being colored with one of k colors, where no edge connects two nodes of the same color.

n	a(n)
0	1
1	1
2	0
3	1
4	1
5	0
6	1
7	2
8	0
9	0
10	1
11	3
12	2
13	0
14	0
15	1
16	4
17	6
18	6
19	0
20	0
21	1
22	5
23	12
24	42
25	38
26	0
27	0
28	1
29	6
30	20
31	132
32	618
33	390
34	0
35	0
36	1
37	7
38	30
39	300
40	3156
41	15990
42	6062
43	0
44	0
45	1
46	8
47	42
48	570
49	9980
50	136980
51	668526
52	134526
53	0
54	0
55	1
56	9
57	56
58	966
59	24330
60	616260
61	10015092
62	43558242
63	4172198
64	0
65	0

[1, 1, 0, 1, 1, 0, 1, 2, 0, 0, 1, 3, 2, 0, 0, 1, 4, 6, 6, 0, 0, 1, 5, 12, 42, 38, 0, 0, 1, 6, 20, 132, 618, 390, 0, 0, 1, 7, 30, 300, 3156, 15990, 6062, 0, 0, 1, 8, 42, 570, 9980, 136980, 668526, 134526, 0, 0, 1, 9, 56, 966, 24330, 616260, 10015092, 43558242, 4172198, 0, 0]

cp's OEIS Frontend

A322279 Array read by antidiagonals: T(n,k) is the number of connected graphs on n labeled nodes, each node being colored with one of k colors, where no edge connects two nodes of the same color.

Table of values

List of values