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.

A049115 a(n) is the number of iterations of the Euler phi function needed to reach a power of 2, when starting from n.

Table of values

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

List of values

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