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.

A324645 a(n) = gcd(d(n), A276086(n)), where d(n) gives the number of divisors (A000005).

Table of values

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

List of values

[1, 1, 2, 3, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 2, 5, 2, 1, 2, 3, 2, 1, 2, 1, 1, 1, 2, 3, 2, 1, 2, 3, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 3, 6, 1, 2, 5, 1, 3, 2, 3, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 6, 7, 2, 1, 2, 3, 2, 1, 2, 1, 2, 1, 6, 3, 2, 1, 2, 5, 5, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3, 6, 9, 2, 1, 2, 1, 2]