A309528 - cp's OEIS frontend

A309528 The number of non-equivalent distinguishing colorings of the cycle on n vertices with at most k colors (k>=1). The cycle graph is defined for n>=3; extended to n=1,2 using the closed form. Square array read by descending antidiagonals: the rows are indexed by n, the number of vertices of the cycle and the columns are indexed by k, the number of permissible colors.

n	a(n)
1	0
2	0
3	0
4	0
5	0
6	0
7	0
8	0
9	0
10	0
11	0
12	0
13	1
14	0
15	0
16	0
17	0
18	4
19	3
20	0
21	0
22	0
23	0
24	10
25	15
26	12
27	1
28	0
29	0
30	0
31	20
32	45
33	72
34	37
35	2
36	0
37	0
38	0
39	35
40	105
41	252
42	266
43	117
44	6
45	0
46	0
47	0
48	56
49	210
50	672
51	1120
52	1044
53	333
54	14
55	0
56	0
57	0
58	84
59	378
60	1512
61	3515
62	5270
63	3788
64	975
65	30
66	0
67	0
68	0
69	120
70	630
71	3024
72	9121
73	19350
74	23475
75	14056
76	2712
77	62
78	0

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 4, 3, 0, 0, 0, 0, 10, 15, 12, 1, 0, 0, 0, 20, 45, 72, 37, 2, 0, 0, 0, 35, 105, 252, 266, 117, 6, 0, 0, 0, 56, 210, 672, 1120, 1044, 333, 14, 0, 0, 0, 84, 378, 1512, 3515, 5270, 3788, 975, 30, 0, 0, 0, 120, 630, 3024, 9121, 19350, 23475, 14056, 2712, 62, 0]

cp's OEIS Frontend

Table of values

List of values