A332053 - cp's OEIS frontend

A332053 a(n) is the number of sets modulo n which can be formed by a finite arithmetic sequence, whose complement cannot be formed by a finite arithmetic sequence.

n	a(n)
1	0
2	0
3	0
4	0
5	0
6	12
7	0
8	24
9	18
10	40
11	0
12	120
13	0
14	84
15	90
16	160
17	0
18	270
19	0
20	320
21	168
22	220
23	0
24	672
25	100
26	312
27	270
28	616
29	0
30	1020
31	0
32	800
33	396
34	544
35	350
36	1656
37	0
38	684
39	546
40	1680
41	0
42	1932
43	0
44	1496
45	1260
46	1012
47	0
48	3168
49	294
50	1850
51	918
52	2080
53	0
54	3132
55	770
56	3136

[0, 0, 0, 0, 0, 12, 0, 24, 18, 40, 0, 120, 0, 84, 90, 160, 0, 270, 0, 320, 168, 220, 0, 672, 100, 312, 270, 616, 0, 1020, 0, 800, 396, 544, 350, 1656, 0, 684, 546, 1680, 0, 1932, 0, 1496, 1260, 1012, 0, 3168, 294, 1850, 918, 2080, 0, 3132, 770, 3136]

cp's OEIS Frontend

A332053 a(n) is the number of sets modulo n which can be formed by a finite arithmetic sequence, whose complement cannot be formed by a finite arithmetic sequence.

Table of values

List of values