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.

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

Table of values

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

List of values

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