A334098 - cp's OEIS frontend

A334098 a(n) = A334097(n) - A331410(n), where former is the exponent of the eventual power of 2 reached, and the latter is the number of iterations needed to get there, when starting from n and using the map k -> k + k/p, where p can be any odd prime factor of k, for example, the largest.

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

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

cp's OEIS Frontend

A334098 a(n) = A334097(n) - A331410(n), where former is the exponent of the eventual power of 2 reached, and the latter is the number of iterations needed to get there, when starting from n and using the map k -> k + k/p, where p can be any odd prime factor of k, for example, the largest.

Table of values

List of values

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

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

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