A336362 - cp's OEIS frontend

A336362 Number of iterations of map k -> k*sigma(p^e)/p^e needed to reach a power of 2, where p is the smallest odd prime factor of k and e is its exponent, when starting from k = n. a(n) = -1 if number of the form 2^k is never reached.

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

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

cp's OEIS Frontend

A336362 Number of iterations of map k -> k*sigma(p^e)/p^e needed to reach a power of 2, where p is the smallest odd prime factor of k and e is its exponent, when starting from k = n. a(n) = -1 if number of the form 2^k is never reached.

Table of values

List of values

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

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

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