A309784 - cp's OEIS frontend

A309784 T(n,k) is the number of non-equivalent distinguishing coloring partitions of the cycle on n vertices with exactly k parts. Regular triangle read by rows, n >= 1, 1 <= k <= n.

n	a(n)
1	0
2	0
3	0
4	0
5	0
6	1
7	0
8	0
9	1
10	1
11	0
12	0
13	4
14	2
15	1
16	0
17	1
18	8
19	10
20	3
21	1
22	0
23	1
24	25
25	32
26	16
27	3
28	1
29	0
30	4
31	62
32	129
33	84
34	27
35	4
36	1
37	0
38	7
39	176
40	468
41	433
42	171
43	37
44	4
45	1
46	0
47	18
48	470
49	1806
50	2260
51	1248
52	338
53	54
54	5
55	1
56	0
57	31
58	1311
59	6780
60	11515
61	8388
62	3056
63	590
64	70
65	5
66	1
67	0
68	70
69	3620
70	25917
71	58312
72	56065
73	26695
74	6907
75	1014
76	96
77	6
78	1

[0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 4, 2, 1, 0, 1, 8, 10, 3, 1, 0, 1, 25, 32, 16, 3, 1, 0, 4, 62, 129, 84, 27, 4, 1, 0, 7, 176, 468, 433, 171, 37, 4, 1, 0, 18, 470, 1806, 2260, 1248, 338, 54, 5, 1, 0, 31, 1311, 6780, 11515, 8388, 3056, 590, 70, 5, 1, 0, 70, 3620, 25917, 58312, 56065, 26695, 6907, 1014, 96, 6, 1]

cp's OEIS Frontend

A309784 T(n,k) is the number of non-equivalent distinguishing coloring partitions of the cycle on n vertices with exactly k parts. Regular triangle read by rows, n >= 1, 1 <= k <= n.

Table of values

List of values