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.

A180794 Number of distinct solutions of sum{i=1..2}(x(2i-1)*x(2i)) = 0 (mod n), with x() in 0..n-1.

Table of values

n a(n)
1 1
2 4
3 8
4 20
5 28
6 56
7 64
8 122
9 150
10 218
11 216
12 424
13 346
14 544
15 667
16 863
17 733
18 1305
19 1000
20 1752
21 1715
22 1944
23 1728
24 3258
25 2535
26 3142
27 3495
28 4520
29 3382
30 6254
31 4096
32 6486
33 6243
34 6812
35 7315
36 10959
37 6868
38 9400
39 10121
40 13922
41 9271
42 16388
43 10648
44 16520
45 17805

List of values

[1, 4, 8, 20, 28, 56, 64, 122, 150, 218, 216, 424, 346, 544, 667, 863, 733, 1305, 1000, 1752, 1715, 1944, 1728, 3258, 2535, 3142, 3495, 4520, 3382, 6254, 4096, 6486, 6243, 6812, 7315, 10959, 6868, 9400, 10121, 13922, 9271, 16388, 10648, 16520, 17805]