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.

A082065 Greatest common prime-divisor of phi(n)=A000010(n) and sigma(2,n) = A001157(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 2
15 2
16 1
17 2
18 1
19 2
20 2
21 2
22 5
23 2
24 2
25 1
26 2
27 2
28 3
29 2
30 2
31 2
32 1
33 5
34 2
35 2
36 3
37 2
38 2
39 2
40 2
41 2
42 2
43 2
44 2
45 2
46 2
47 2
48 2
49 3
50 5
51 2
52 3
53 2
54 2
55 2
56 2
57 2
58 2
59 2
60 2
61 2
62 5
63 2
64 1
65 2
66 5
67 2
68 2
69 2
70 2
71 2
72 1
73 2
74 2
75 5
76 3
77 5
78 2
79 2
80 2
81 1
82 5
83 2
84 3
85 2
86 2
87 2
88 5
89 2
90 2
91 2
92 2
93 5
94 2
95 2
96 2
97 2
98 3
99 2
100 1

List of values

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