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.

A326057 a(n) = gcd(A003961(n)-2n, A003961(n)-sigma(n)), where A003961(n) is fully multiplicative function with a(prime(k)) = prime(k+1).

Table of values

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

List of values

[1, 1, 1, 1, 1, 3, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 3, 3, 1, 1, 1, 1, 3, 1, 1, 1, 43, 1, 3, 5, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 3, 3, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 3, 19, 1, 1, 1, 1, 3, 5, 1, 1, 1, 1, 3, 3, 5, 7, 1, 1, 3, 1, 1, 1, 1, 1, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 5, 1, 1, 1, 1, 3, 3, 1, 1, 1, 1, 3, 3, 1, 1]