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.

A324191 Number of divisors of n minus the number of distinct values that A297167 obtains over the divisors > 1 of n: a(n) = A000005(n) - A324190(n).

Table of values

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

List of values

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