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.

A053475 1 + the number of iterations of A051953 (Euler-cototient) function needed to reach 0, starting at n.

Table of values

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

List of values

[2, 3, 3, 4, 3, 5, 3, 5, 4, 6, 3, 6, 3, 6, 4, 6, 3, 7, 3, 7, 5, 7, 3, 7, 4, 7, 5, 7, 3, 8, 3, 7, 4, 8, 4, 8, 3, 8, 5, 8, 3, 9, 3, 8, 6, 8, 3, 8, 4, 9, 4, 8, 3, 9, 5, 8, 6, 9, 3, 9, 3, 8, 6, 8, 4, 9, 3, 9, 5, 9, 3, 9, 3, 9, 5, 9, 4, 10, 3, 9, 6, 10, 3, 10, 6, 9, 4, 9, 3, 10, 4, 9, 5, 9, 4, 9, 3, 9, 6, 10, 3, 10]