A321791 - cp's OEIS frontend

A321791 Table read by descending antidiagonals: T(n,k) is the number of unoriented cycles (bracelets) of length n using up to k available colors.

n	a(n)
0	1
1	1
2	0
3	1
4	1
5	0
6	1
7	2
8	1
9	0
10	1
11	3
12	3
13	1
14	0
15	1
16	4
17	6
18	4
19	1
20	0
21	1
22	5
23	10
24	10
25	6
26	1
27	0
28	1
29	6
30	15
31	20
32	21
33	8
34	1
35	0
36	1
37	7
38	21
39	35
40	55
41	39
42	13
43	1
44	0
45	1
46	8
47	28
48	56
49	120
50	136
51	92
52	18
53	1
54	0
55	1
56	9
57	36
58	84
59	231
60	377
61	430
62	198
63	30
64	1
65	0

[1, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 3, 3, 1, 0, 1, 4, 6, 4, 1, 0, 1, 5, 10, 10, 6, 1, 0, 1, 6, 15, 20, 21, 8, 1, 0, 1, 7, 21, 35, 55, 39, 13, 1, 0, 1, 8, 28, 56, 120, 136, 92, 18, 1, 0, 1, 9, 36, 84, 231, 377, 430, 198, 30, 1, 0]

cp's OEIS Frontend

A321791 Table read by descending antidiagonals: T(n,k) is the number of unoriented cycles (bracelets) of length n using up to k available colors.

Table of values

List of values

n	a(n)
0	1
1	1
2	0
3	1
4	1
5	0
6	1
7	2
8	1
9	0
10	1
11	3
12	3
13	1
14	0
15	1
16	4
17	6
18	4
19	1
20	0
21	1
22	5
23	10
24	10
25	6
26	1
27	0
28	1
29	6
30	15
31	20
32	21
33	8
34	1
35	0
36	1
37	7
38	21
39	35
40	55
41	39
42	13
43	1
44	0
45	1
46	8
47	28
48	56
49	120
50	136
51	92
52	18
53	1
54	0
55	1
56	9
57	36
58	84
59	231
60	377
61	430
62	198
63	30
64	1
65	0

n	a(n)
0	1
1	1
2	0
3	1
4	1
5	0
6	1
7	2
8	1
9	0
10	1
11	3
12	3
13	1
14	0
15	1
16	4
17	6
18	4
19	1
20	0
21	1
22	5
23	10
24	10
25	6
26	1
27	0
28	1
29	6
30	15
31	20
32	21
33	8
34	1
35	0
36	1
37	7
38	21
39	35
40	55
41	39
42	13
43	1
44	0
45	1
46	8
47	28
48	56
49	120
50	136
51	92
52	18
53	1
54	0
55	1
56	9
57	36
58	84
59	231
60	377
61	430
62	198
63	30
64	1
65	0

n	a(n)
0	1
1	1
2	0
3	1
4	1
5	0
6	1
7	2
8	1
9	0
10	1
11	3
12	3
13	1
14	0
15	1
16	4
17	6
18	4
19	1
20	0
21	1
22	5
23	10
24	10
25	6
26	1
27	0
28	1
29	6
30	15
31	20
32	21
33	8
34	1
35	0
36	1
37	7
38	21
39	35
40	55
41	39
42	13
43	1
44	0
45	1
46	8
47	28
48	56
49	120
50	136
51	92
52	18
53	1
54	0
55	1
56	9
57	36
58	84
59	231
60	377
61	430
62	198
63	30
64	1
65	0