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.

A327166 Number of divisors d of n for which A000005(d)*d is equal to n, where A000005(x) gives the number of divisors of x.

Table of values

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

List of values

[1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1]