A074347 - cp's OEIS frontend

A074347 Smallest number requiring n steps to reach 0 when iterating the function: f(n)=abs(lpd(n)-Lpf(n)), where lpd(n) is the largest proper divisor of n and Lpf(n) is the largest prime factor of n.

n	a(n)
1	1
2	2
3	3
4	12
5	13
6	52
7	53
8	131
9	271
10	811
11	1601
12	2711
13	8111
14	13997
15	34589
16	74551
17	147773
18	310567
19	621227
20	1230343
21	2627759
22	4921373
23	10741931
24	24965191
25	45887291
26	111477631
27	183638843
28	394195667
29	788380493
30	1576798931

[1, 2, 3, 12, 13, 52, 53, 131, 271, 811, 1601, 2711, 8111, 13997, 34589, 74551, 147773, 310567, 621227, 1230343, 2627759, 4921373, 10741931, 24965191, 45887291, 111477631, 183638843, 394195667, 788380493, 1576798931]

cp's OEIS Frontend

A074347 Smallest number requiring n steps to reach 0 when iterating the function: f(n)=abs(lpd(n)-Lpf(n)), where lpd(n) is the largest proper divisor of n and Lpf(n) is the largest prime factor of n.

Table of values

List of values