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.

A039651 Number of iterations of f(x) = phi(x)+1 on n required to reach a prime.

Table of values

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

List of values

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