A075660 - cp's OEIS frontend

A075660 Let f(n) = abs(lpd(n)-gpf(n)), where lpd(n) is the largest proper divisor of n and gpf(n) is the greatest prime factor of n. Sequence gives number of iterations for f(n) to reach zero.

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

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

cp's OEIS Frontend

A075660 Let f(n) = abs(lpd(n)-gpf(n)), where lpd(n) is the largest proper divisor of n and gpf(n) is the greatest prime factor of n. Sequence gives number of iterations for f(n) to reach zero.

Table of values

List of values

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

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

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