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.

A087893 Number of numbers m satisfying 1 < m < n such that m^2 == m (mod n).

Table of values

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

List of values

[0, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 2, 0, 2, 2, 0, 0, 2, 0, 2, 2, 2, 0, 2, 0, 2, 0, 2, 0, 6, 0, 0, 2, 2, 2, 2, 0, 2, 2, 2, 0, 6, 0, 2, 2, 2, 0, 2, 0, 2, 2, 2, 0, 2, 2, 2, 2, 2, 0, 6, 0, 2, 2, 0, 2, 6, 0, 2, 2, 6, 0, 2, 0, 2, 2, 2, 2, 6, 0, 2, 0, 2, 0, 6, 2, 2, 2, 2, 0, 6, 2, 2, 2, 2, 2, 2, 0, 2, 2, 2, 0, 6, 0, 2, 6]