Least k <= n such that n*bigomega(k) = k*bigomega(n), where bigomega(n) = the number of prime divisors of n (counted with multiplicity) A001222.
A094020
Least k <= n such that n*bigomega(k) = k*bigomega(n), where bigomega(n) = the number of prime divisors of n (counted with multiplicity) A001222.
Terms
- a(0) =1a(1) =2a(2) =3a(3) =2a(4) =5a(5) =3a(6) =7a(7) =8a(8) =9a(9) =5a(10) =11a(11) =12a(12) =13a(13) =7a(14) =15a(15) =12a(16) =17a(17) =18a(18) =19a(19) =20a(20) =21a(21) =11a(22) =23a(23) =18a(24) =25a(25) =13a(26) =27a(27) =28a(28) =29a(29) =30
External references
- oeis: A094020