A324802 - cp's OEIS frontend

A324802 T(n,k) is the number of non-equivalent distinguishing 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	0
7	0
8	0
9	0
10	0
11	0
12	0
13	0
14	0
15	0
16	0
17	0
18	4
19	2
20	0
21	0
22	0
23	1
24	12
25	17
26	4
27	0
28	0
29	0
30	2
31	43
32	82
33	49
34	9
35	0
36	0
37	0
38	7
39	137
40	388
41	339
42	125
43	15
44	0
45	0
46	0
47	12
48	404
49	1572
50	1994
51	1044
52	254
53	24
54	0
55	0
56	0
57	31
58	1190
59	6405
60	10900
61	7928
62	2761
63	490
64	35
65	0
66	0
67	0
68	57
69	3394
70	24853
71	56586
72	54272
73	25609
74	6365
75	850
76	51
77	0
78	0

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 2, 0, 0, 0, 1, 12, 17, 4, 0, 0, 0, 2, 43, 82, 49, 9, 0, 0, 0, 7, 137, 388, 339, 125, 15, 0, 0, 0, 12, 404, 1572, 1994, 1044, 254, 24, 0, 0, 0, 31, 1190, 6405, 10900, 7928, 2761, 490, 35, 0, 0, 0, 57, 3394, 24853, 56586, 54272, 25609, 6365, 850, 51, 0, 0]

cp's OEIS Frontend

A324802 T(n,k) is the number of non-equivalent distinguishing 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