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.

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

List of values

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