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.

A065293 Number of values of s, 0 <= s <= n-1, such that 2^s mod n = s.

Table of values

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

List of values

[1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 2, 0, 0, 1, 0, 2, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 2, 1, 1, 1, 0, 0, 3, 0, 0, 1, 1, 2, 0, 1, 2, 1, 0, 2, 0, 2, 0, 1, 1, 1, 1, 0, 2, 1, 0, 0, 0, 2, 1, 1, 1, 1, 1, 0, 1, 2, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 2, 2, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1]