A332496 - cp's OEIS frontend

A332496 Triangular array T(n,k): the number of not necessarily proper colorings of the complete graph on n unlabeled vertices minus an edge using exactly k colors.

n	a(n)
1	0
2	1
3	1
4	1
5	4
6	3
7	1
8	7
9	12
10	6
11	1
12	10
13	27
14	28
15	10
16	1
17	13
18	48
19	76
20	55
21	15
22	1
23	16
24	75
25	160
26	175
27	96
28	21
29	1
30	19
31	108
32	290
33	425
34	351
35	154
36	28
37	1
38	22
39	147
40	476
41	875
42	966
43	637
44	232
45	36
46	1
47	25
48	192
49	728
50	1610
51	2226
52	1960
53	1072
54	333
55	45
56	1
57	28
58	243
59	1056
60	2730
61	4536
62	4998
63	3648
64	1701
65	460
66	55

[0, 1, 1, 1, 4, 3, 1, 7, 12, 6, 1, 10, 27, 28, 10, 1, 13, 48, 76, 55, 15, 1, 16, 75, 160, 175, 96, 21, 1, 19, 108, 290, 425, 351, 154, 28, 1, 22, 147, 476, 875, 966, 637, 232, 36, 1, 25, 192, 728, 1610, 2226, 1960, 1072, 333, 45, 1, 28, 243, 1056, 2730, 4536, 4998, 3648, 1701, 460, 55]

cp's OEIS Frontend

A332496 Triangular array T(n,k): the number of not necessarily proper colorings of the complete graph on n unlabeled vertices minus an edge using exactly k colors.

Table of values

List of values