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.

A335885 The length of a shortest path from n to a power of 2, when applying the nondeterministic maps k -> k - k/p and k -> k + k/p, where p can be any of the odd prime factors of k, and the maps can be applied in any order.

Table of values

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

List of values

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