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.

A003434 Number of iterations of phi(x) at n needed to reach 1.

Table of values

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

List of values

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