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.

A064415 a(1) = 0, a(n) = iter(n) if n is even, a(n) = iter(n)-1 if n is odd, where iter(n) = A003434(n) = smallest number of iterations of Euler totient function phi needed to reach 1.

Table of values

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

List of values

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