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.

A329612 a(n) = gcd(d(n), d(A108951(n))), where d(n) gives the number of divisors of n, A000005(n), and A108951 is fully multiplicative with a(prime(i)) = prime(i)# = prime(1) * ... * prime(i).

Table of values

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

List of values

[1, 2, 2, 3, 2, 2, 2, 4, 3, 4, 2, 2, 2, 4, 2, 5, 2, 6, 2, 2, 4, 4, 2, 2, 3, 4, 4, 2, 2, 8, 2, 6, 4, 4, 2, 3, 2, 4, 4, 4, 2, 8, 2, 2, 2, 4, 2, 2, 3, 6, 4, 2, 2, 4, 4, 8, 4, 4, 2, 6, 2, 4, 2, 7, 4, 8, 2, 2, 4, 8, 2, 6, 2, 4, 6, 2, 2, 8, 2, 2, 5, 4, 2, 12, 4, 4, 4, 8, 2, 4, 4, 2, 4, 4, 4, 2, 2, 6, 2, 9, 2, 8, 2, 8, 8]