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.

A326197 Number of divisors of n that are not reachable from n with any combination of transitions x -> gcd(x,sigma(x)) and x -> gcd(x,phi(x)).

Table of values

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

List of values

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