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.

A317751 Number of divisors d of n such that there exists a factorization of n into factors > 1 with GCD d.

Table of values

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

List of values

[0, 1, 1, 2, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 1, 3, 1, 3, 2, 2, 1, 3, 2, 2, 2, 3, 1, 2, 1, 3, 2, 2, 2, 5, 1, 2, 2, 3, 1, 2, 1, 3, 3, 2, 1, 4, 2, 3, 2, 3, 1, 3, 2, 3, 2, 2, 1, 3, 1, 2, 3, 4, 2, 2, 1, 3, 2, 2, 1, 5, 1, 2, 3, 3, 2, 2, 1, 4, 3, 2, 1, 3, 2, 2, 2, 3, 1, 3, 2, 3, 2, 2, 2, 4, 1, 3, 3, 5, 1, 2, 1, 3, 2]