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.

A049865 Number of iterations of unitary totient function (A047994) required to reach 1 from n.

Table of values

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

List of values

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