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.

A318623 a(n) = 2^phi(n) mod n.

Table of values

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

List of values

[0, 0, 1, 0, 1, 4, 1, 0, 1, 6, 1, 4, 1, 8, 1, 0, 1, 10, 1, 16, 1, 12, 1, 16, 1, 14, 1, 8, 1, 16, 1, 0, 1, 18, 1, 28, 1, 20, 1, 16, 1, 22, 1, 12, 1, 24, 1, 16, 1, 26, 1, 40, 1, 28, 1, 8, 1, 30, 1, 16, 1, 32, 1, 0, 1, 34, 1, 52, 1, 36, 1, 64, 1, 38, 1, 20, 1, 40, 1]