A238529 - cp's OEIS frontend

A238529 a(0) = a(1) = 0, and for n > 1, a(n) = number of iterations of A238525 (n modulo sopfr(n)) needed to reach either 0 or 1. Here sopfr(n) is the sum of the prime factors of n, with multiplicity, A001414.

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

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

cp's OEIS Frontend

A238529 a(0) = a(1) = 0, and for n > 1, a(n) = number of iterations of A238525 (n modulo sopfr(n)) needed to reach either 0 or 1. Here sopfr(n) is the sum of the prime factors of n, with multiplicity, A001414.

Table of values

List of values

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

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

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