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.

A300307 Number of solutions to 1 +- 3 +- 6 +- ... +- n*(n+1)/2 == 0 mod n.

Table of values

n a(n)
1 1
2 2
3 0
4 4
5 4
6 16
7 12
8 32
9 20
10 112
11 88
12 384
13 308
14 1264
15 1056
16 4096
17 3852
18 15120
19 13820
20 52608
21 49824
22 190848
23 182356
24 704512
25 671540
26 2582128
27 2475220
28 9615744
29 9256428
30 35868672
31 34636840
32 134217728
33 130021392
34 505292976
35 491156304
36 1909836416
37 1857282536

List of values

[1, 2, 0, 4, 4, 16, 12, 32, 20, 112, 88, 384, 308, 1264, 1056, 4096, 3852, 15120, 13820, 52608, 49824, 190848, 182356, 704512, 671540, 2582128, 2475220, 9615744, 9256428, 35868672, 34636840, 134217728, 130021392, 505292976, 491156304, 1909836416, 1857282536]