For n > 1, a(n) is the least number of prime factors (counted with multiplicity) of any integer with n divisors; fully additive with a(p) = p-1.
A059975
For n > 1, a(n) is the least number of prime factors (counted with multiplicity) of any integer with n divisors; fully additive with a(p) = p-1.
Terms
- a(0) =0a(1) =1a(2) =2a(3) =2a(4) =4a(5) =3a(6) =6a(7) =3a(8) =4a(9) =5a(10) =10a(11) =4a(12) =12a(13) =7a(14) =6a(15) =4a(16) =16a(17) =5a(18) =18a(19) =6a(20) =8a(21) =11a(22) =22a(23) =5a(24) =8a(25) =13a(26) =6a(27) =8a(28) =28a(29) =7
External references
- oeis: A059975