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.

A374126 a(n) = gcd(sigma(n), sopfr(n)), where sigma is the sum of divisors, and sopfr is the sum of prime factors with repetition.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 7, 1, 3, 8, 1, 1, 1, 1, 3, 2, 1, 1, 3, 1, 3, 1, 1, 1, 2, 1, 1, 2, 1, 12, 1, 1, 3, 8, 1, 1, 12, 1, 3, 1, 1, 1, 1, 1, 3, 4, 1, 1, 1, 8, 1, 2, 1, 1, 12, 1, 3, 13, 1, 6, 16, 1, 21, 2, 2, 1, 3, 1, 3, 1, 1, 6, 6, 1, 1, 1, 1, 1, 14, 2, 3, 8, 1, 1, 13, 4, 3, 2, 1, 24, 1, 1, 1, 1, 7, 1, 2]