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.
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.
Terms
- a(0) =1a(1) =2a(2) =3a(3) =1a(4) =2a(5) =1a(6) =2a(7) =3a(8) =1a(9) =1a(10) =2a(11) =4a(12) =5a(13) =1a(14) =1a(15) =2a(16) =3a(17) =2a(18) =3a(19) =3a(20) =1a(21) =1a(22) =2a(23) =2a(24) =1a(25) =1a(26) =2a(27) =3a(28) =4a(29) =2
External references
- oeis: A075660