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.

A101606 a(n) = number of divisors of n that have exactly three (not necessarily distinct) prime factors.

Table of values

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

List of values

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