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.

A329152 a(n) = Sum_{i=1..n-1} Sum_{j=1..i-1} [1 == i*j (mod n)], where [] is the Iverson bracket.

Table of values

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

List of values

[0, 0, 0, 0, 1, 0, 2, 0, 2, 1, 4, 0, 5, 2, 2, 2, 7, 2, 8, 2, 4, 4, 10, 0, 9, 5, 8, 4, 13, 2, 14, 6, 8, 7, 10, 4, 17, 8, 10, 4, 19, 4, 20, 8, 10, 10, 22, 4, 20, 9, 14, 10, 25, 8, 18, 8, 16, 13, 28, 4, 29, 14, 16, 14, 22, 8, 32, 14, 20, 10, 34, 8, 35, 17, 18, 16, 28, 10, 38, 12]