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.

A329697 a(n) is the number of iterations needed to reach a power of 2 starting at n and using the map k -> k-(k/p), where p is the largest prime factor of k.

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 2
16 0
17 1
18 2
19 3
20 1
21 3
22 2
23 3
24 1
25 2
26 2
27 3
28 2
29 3
30 2
31 3
32 0
33 3
34 1
35 3
36 2
37 3
38 3
39 3
40 1
41 2
42 3
43 4
44 2
45 3
46 3
47 4
48 1
49 4
50 2
51 2
52 2
53 3
54 3
55 3
56 2
57 4
58 3
59 4
60 2
61 3
62 3
63 4
64 0
65 3
66 3
67 4
68 1
69 4
70 3
71 4
72 2
73 3
74 3
75 3
76 3
77 4
78 3
79 4
80 1
81 4
82 2
83 3
84 3
85 2
86 4
87 4
88 2
89 3
90 3
91 4
92 3
93 4
94 4
95 4
96 1
97 2
98 4
99 4
100 2

List of values

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