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.

A082064 Greatest common prime-divisor of phi(n) and sigma(n) = A000203(n); a(n)=1 if no common prime-divisor exists.

Table of values

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

List of values

[1, 1, 2, 1, 2, 2, 2, 1, 1, 2, 2, 2, 2, 3, 2, 1, 2, 3, 2, 2, 2, 2, 2, 2, 1, 3, 2, 2, 2, 2, 2, 1, 2, 2, 3, 1, 2, 3, 2, 2, 2, 3, 2, 2, 3, 2, 2, 2, 3, 1, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 2, 3, 2, 1, 3, 2, 2, 2, 2, 3, 2, 3, 2, 3, 2, 2, 3, 3, 2, 2, 1, 2, 2, 2, 2, 3, 2, 5, 2, 3, 2, 2, 2, 2, 3, 2, 2, 3, 3, 1, 2, 2, 2, 3, 3]