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.

A071575 Number of iterations of cototient(n) needed to reach 1 (cototient(n) = n-phi(n)).

Table of values

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

List of values

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