A322280 - cp's OEIS frontend

A322280 Array read by antidiagonals: T(n,k) is the number of 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	1
9	0
10	1
11	3
12	6
13	1
14	0
15	1
16	4
17	15
18	26
19	1
20	0
21	1
22	5
23	28
24	123
25	162
26	1
27	0
28	1
29	6
30	45
31	340
32	1635
33	1442
34	1
35	0
36	1
37	7
38	66
39	725
40	7108
41	35043
42	18306
43	1
44	0
45	1
46	8
47	91
48	1326
49	20805
50	254404
51	1206915
52	330626
53	1
54	0
55	1
56	9
57	120
58	2191
59	48486
60	1058885
61	15531268
62	66622083
63	8488962
64	1
65	0

[1, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 3, 6, 1, 0, 1, 4, 15, 26, 1, 0, 1, 5, 28, 123, 162, 1, 0, 1, 6, 45, 340, 1635, 1442, 1, 0, 1, 7, 66, 725, 7108, 35043, 18306, 1, 0, 1, 8, 91, 1326, 20805, 254404, 1206915, 330626, 1, 0, 1, 9, 120, 2191, 48486, 1058885, 15531268, 66622083, 8488962, 1, 0]

cp's OEIS Frontend

A322280 Array read by antidiagonals: T(n,k) is the number of 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