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.

A327161 Number of positive integers that are reachable from n with some combination of transitions x -> usigma(x)-x and x -> gcd(x,phi(x)), where usigma is the sum of unitary divisors of n (A034448), and phi is Euler totient function (A000010).

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

List of values

[1, 2, 2, 3, 2, 3, 2, 4, 3, 5, 2, 5, 2, 6, 4, 5, 2, 7, 2, 6, 4, 7, 2, 6, 3, 6, 4, 6, 2, 10, 2, 6, 5, 7, 3, 8, 2, 8, 4, 7, 2, 10, 2, 6, 5, 7, 2, 8, 3, 8, 5, 8, 2, 10, 4, 6, 4, 7, 2, 4, 2, 8, 5, 7, 3, 6, 2, 8, 5, 9, 2, 9, 2, 8, 4, 7, 3, 5, 2, 9, 5, 7, 2, 8, 3, 8, 6, 7, 2, 4, 5, 7, 5, 9, 4, 11, 2, 11, 5, 13, 2, 10, 2, 8, 7]