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.

A379259 a(n) is the number of iterations that n requires to reach a 3-smooth number under the map x -> phi(x).

Table of values

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

List of values

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