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.

A032358 Number of iterations of phi(n) needed to reach 2.

Table of values

n a(n)
2 0
3 1
4 1
5 2
6 1
7 2
8 2
9 2
10 2
11 3
12 2
13 3
14 2
15 3
16 3
17 4
18 2
19 3
20 3
21 3
22 3
23 4
24 3
25 4
26 3
27 3
28 3
29 4
30 3
31 4
32 4
33 4
34 4
35 4
36 3
37 4
38 3
39 4
40 4
41 5
42 3
43 4
44 4
45 4
46 4
47 5
48 4
49 4
50 4
51 5
52 4
53 5
54 3
55 5
56 4
57 4
58 4
59 5
60 4
61 5
62 4
63 4
64 5
65 5
66 4
67 5
68 5
69 5
70 4
71 5
72 4
73 5
74 4
75 5
76 4
77 5
78 4
79 5
80 5

List of values

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