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.

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

Table of values

n a(n)
1 0
2 0
3 1
4 4
5 9
6 19
7 31
8 42
9 75
10 91
11 136
12 160
13 232
14 254
15 364
16 388
17 542
18 525
19 767
20 754
21 1015
22 993
23 1389
24 1256
25 1795
26 1641
27 2169
28 2080
29 2838
30 2344
31 3484
32 3144
33 3971
34 3676
35 4980
36 4152
37 5989
38 5135
39 6564
40 6008
41 8195
42 6392
43 9476
44 8064
45 9912
46 9114
47 12426
48 9808
49 14032

List of values

[0, 0, 1, 4, 9, 19, 31, 42, 75, 91, 136, 160, 232, 254, 364, 388, 542, 525, 767, 754, 1015, 993, 1389, 1256, 1795, 1641, 2169, 2080, 2838, 2344, 3484, 3144, 3971, 3676, 4980, 4152, 5989, 5135, 6564, 6008, 8195, 6392, 9476, 8064, 9912, 9114, 12426, 9808, 14032]