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.

A110981 a(n) = the number of aperiodic subsets S of the n-th roots of 1 with zero sum (i.e., there is no r different from 1 such that r*S=S).

Table of values

n a(n)
1 1
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
10 0
11 0
12 2
13 0
14 0
15 0
16 0
17 0
18 24
19 0
20 6
21 0
22 0
23 0
24 236
25 0
26 0
27 0
28 18
29 0
30 3768
31 0
32 0
33 0
34 0
35 0
36 20384
37 0
38 0
39 0
40 7188
41 0
42 227784
43 0
44 186
45 480
46 0
47 0
48 1732448
49 0
50 237600
51 0
52 630
53 0
54 16028160
55 0
56 306684
57 0
58 0
59 0
60 341521732
61 0
62 0
63 4896
64 0
65 0
66 1417919208

List of values

[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 24, 0, 6, 0, 0, 0, 236, 0, 0, 0, 18, 0, 3768, 0, 0, 0, 0, 0, 20384, 0, 0, 0, 7188, 0, 227784, 0, 186, 480, 0, 0, 1732448, 0, 237600, 0, 630, 0, 16028160, 0, 306684, 0, 0, 0, 341521732, 0, 0, 4896, 0, 0, 1417919208]