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.

A063776 Number of subsets of {1,2,...,n} which sum to 0 modulo n.

Table of values

n a(n)
1 2
2 2
3 4
4 4
5 8
6 12
7 20
8 32
9 60
10 104
11 188
12 344
13 632
14 1172
15 2192
16 4096
17 7712
18 14572
19 27596
20 52432
21 99880
22 190652
23 364724
24 699072
25 1342184
26 2581112
27 4971068
28 9586984
29 18512792
30 35791472
31 69273668
32 134217728
33 260301176
34 505290272
35 981706832

List of values

[2, 2, 4, 4, 8, 12, 20, 32, 60, 104, 188, 344, 632, 1172, 2192, 4096, 7712, 14572, 27596, 52432, 99880, 190652, 364724, 699072, 1342184, 2581112, 4971068, 9586984, 18512792, 35791472, 69273668, 134217728, 260301176, 505290272, 981706832]