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.

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

Table of values

n a(n)
1 0
2 1
3 2
4 2
5 3
6 2
7 4
8 4
9 4
10 3
11 6
12 4
13 7
14 4
15 6
16 6
17 9
18 4
19 10
20 6
21 8
22 6
23 12
24 8
25 11
26 7
27 10
28 8
29 15
30 6
31 16
32 10
33 12
34 9
35 14
36 8
37 19
38 10
39 14
40 12
41 21
42 8
43 22
44 12
45 14
46 12
47 24
48 12
49 22
50 11
51 18
52 14
53 27
54 10
55 22
56 16
57 20
58 15
59 30
60 12
61 31
62 16
63 20
64 18
65 26
66 12
67 34
68 18
69 24
70 14
71 36
72 16
73 37
74 19
75 22
76 20
77 32
78 14
79 40
80 20
81 28

List of values

[0, 1, 2, 2, 3, 2, 4, 4, 4, 3, 6, 4, 7, 4, 6, 6, 9, 4, 10, 6, 8, 6, 12, 8, 11, 7, 10, 8, 15, 6, 16, 10, 12, 9, 14, 8, 19, 10, 14, 12, 21, 8, 22, 12, 14, 12, 24, 12, 22, 11, 18, 14, 27, 10, 22, 16, 20, 15, 30, 12, 31, 16, 20, 18, 26, 12, 34, 18, 24, 14, 36, 16, 37, 19, 22, 20, 32, 14, 40, 20, 28]