A324803 - cp's OEIS frontend

A324803 T(n,k) is the number of non-equivalent distinguishing partitions of the cycle on n vertices with at most k part. Square array read by descending antidiagonals, n >= 1, k >= 1.

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	0
19	0
20	0
21	0
22	0
23	0
24	0
25	0
26	0
27	0
28	0
29	0
30	0
31	0
32	0
33	0
34	4
35	1
36	0
37	0
38	0
39	0
40	0
41	0
42	6
43	13
44	2
45	0
46	0
47	0
48	0
49	0
50	0
51	6
52	30
53	45
54	7
55	0
56	0
57	0
58	0
59	0
60	0
61	6
62	34
63	127
64	144
65	12
66	0
67	0
68	0
69	0
70	0
71	0
72	6
73	34
74	176
75	532
76	416
77	31
78	0
79	0
80	0
81	0
82	0
83	0
84	6
85	34
86	185
87	871
88	1988
89	1221
90	57
91	0
92	0
93	0
94	0
95	0
96	0
97	6
98	34
99	185
100	996
101	3982

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 1, 0, 0, 0, 0, 0, 0, 6, 13, 2, 0, 0, 0, 0, 0, 0, 6, 30, 45, 7, 0, 0, 0, 0, 0, 0, 6, 34, 127, 144, 12, 0, 0, 0, 0, 0, 0, 6, 34, 176, 532, 416, 31, 0, 0, 0, 0, 0, 0, 6, 34, 185, 871, 1988, 1221, 57, 0, 0, 0, 0, 0, 0, 6, 34, 185, 996, 3982]

cp's OEIS Frontend

A324803 T(n,k) is the number of non-equivalent distinguishing partitions of the cycle on n vertices with at most k part. Square array read by descending antidiagonals, n >= 1, k >= 1.

Table of values

List of values