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.

A197928 Number of pairs of integers i,j with 1<=i<=n, 1<=j<=i, such that i^2-j^2 = i*j (mod n).

Table of values

n a(n)
1 1
2 1
3 1
4 3
5 3
6 1
7 1
8 3
9 6
10 3
11 11
12 3
13 1
14 1
15 3
16 10
17 1
18 6
19 19
20 11
21 1
22 11
23 1
24 3
25 15
26 1
27 6
28 3
29 29
30 3
31 31
32 10
33 11
34 1
35 3
36 21
37 1
38 19
39 1
40 11
41 41
42 1
43 1
44 43
45 24
46 1
47 1
48 10
49 28
50 15
51 1
52 3
53 1
54 6
55 53
56 3
57 19
58 29
59 59
60 11
61 61
62 31
63 6
64 36
65 3
66 11
67 1
68 3
69 1
70 3
71 71
72 21
73 1
74 1
75 15
76 75
77 11
78 1
79 79
80 42
81 45
82 41
83 1
84 3
85 3
86 1
87 29
88 43
89 89
90 24
91 1
92 3
93 31
94 1
95 93
96 10
97 1
98 28
99 96
100 55
101 101
102 1
103 1
104 3
105 3

List of values

[1, 1, 1, 3, 3, 1, 1, 3, 6, 3, 11, 3, 1, 1, 3, 10, 1, 6, 19, 11, 1, 11, 1, 3, 15, 1, 6, 3, 29, 3, 31, 10, 11, 1, 3, 21, 1, 19, 1, 11, 41, 1, 1, 43, 24, 1, 1, 10, 28, 15, 1, 3, 1, 6, 53, 3, 19, 29, 59, 11, 61, 31, 6, 36, 3, 11, 1, 3, 1, 3, 71, 21, 1, 1, 15, 75, 11, 1, 79, 42, 45, 41, 1, 3, 3, 1, 29, 43, 89, 24, 1, 3, 31, 1, 93, 10, 1, 28, 96, 55, 101, 1, 1, 3, 3]