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.

A062173 a(n) = 2^(n-1) mod n.

Table of values

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

List of values

[0, 0, 1, 0, 1, 2, 1, 0, 4, 2, 1, 8, 1, 2, 4, 0, 1, 14, 1, 8, 4, 2, 1, 8, 16, 2, 13, 8, 1, 2, 1, 0, 4, 2, 9, 32, 1, 2, 4, 8, 1, 32, 1, 8, 31, 2, 1, 32, 15, 12, 4, 8, 1, 14, 49, 16, 4, 2, 1, 8, 1, 2, 4, 0, 16, 32, 1, 8, 4, 22, 1, 32, 1, 2, 34, 8, 9, 32, 1, 48, 40, 2, 1, 32, 16, 2, 4, 40, 1, 32, 64, 8, 4, 2, 54, 32, 1, 58, 58, 88, 1, 32, 1, 24, 46]