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.

A138010 a(n) is the number of positive divisors of n that divide d(n), where d(n) is the number of positive divisors of n, A000005(n); a(n) also equals d(gcd(n, d(n))).

Table of values

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

List of values

[1, 2, 1, 1, 1, 2, 1, 3, 2, 2, 1, 4, 1, 2, 1, 1, 1, 4, 1, 2, 1, 2, 1, 4, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 4, 1, 2, 1, 6, 1, 2, 2, 1, 1, 2, 1, 2, 1, 2, 1, 6, 1, 2, 2, 2, 1, 2, 1, 4, 1, 2, 1, 6, 1, 2, 1, 4, 1, 4, 1, 2, 1, 2, 1, 6, 1, 2, 2, 1, 1, 2, 1, 4, 1, 2, 1, 6, 1, 2, 1, 2, 1, 2, 1, 2, 2, 2, 1, 4]