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.

A300218 Number of solutions to 1 +- 3 +- 5 +- ... +- (2*n-1) == 0 mod n.

Table of values

n a(n)
1 1
2 2
3 2
4 4
5 4
6 12
7 10
8 36
9 30
10 104
11 94
12 344
13 316
14 1172
15 1096
16 4132
17 3856
18 14572
19 13798
20 52432
21 49940
22 190652
23 182362
24 699416
25 671092
26 2581112
27 2485534
28 9586984
29 9256396
30 35791472
31 34636834
32 134221860
33 130150588
34 505290272
35 490853416
36 1908874584
37 1857283156

List of values

[1, 2, 2, 4, 4, 12, 10, 36, 30, 104, 94, 344, 316, 1172, 1096, 4132, 3856, 14572, 13798, 52432, 49940, 190652, 182362, 699416, 671092, 2581112, 2485534, 9586984, 9256396, 35791472, 34636834, 134221860, 130150588, 505290272, 490853416, 1908874584, 1857283156]