cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A306275 Number of values 0 < k <= n for which there are no k distinct n-th roots of unity that sum to zero.

Table of values

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

List of values

[1, 1, 2, 2, 4, 2, 6, 4, 6, 4, 10, 2, 12, 6, 8, 8, 16, 2, 18, 4, 12, 10, 22, 2, 20, 12, 18, 6, 28, 2, 30, 16, 20, 16, 24, 2, 36, 18, 24, 4, 40, 2, 42, 10, 8, 22, 46, 2, 42, 4, 32, 12, 52, 2, 40, 6, 36, 28, 58, 2, 60, 30, 12, 32, 48, 2, 66, 16, 44, 4, 70, 2, 72]