A335884 - cp's OEIS frontend

A335884 The length of a longest 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.

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

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

cp's OEIS Frontend

A335884 The length of a longest 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

List of values

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

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

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