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.

A073407 Let phi_m(x) denote the Euler totient function applied m times to x. Sequence gives the minimum number of iterations m such that phi_m(n) divides n.

Table of values

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

List of values

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