The least prime p such that equation x = p*sopf(x) (where sopf(x) is the sum of distinct prime factors of x) has exactly n solutions in positive integers.
A336296
The least prime p such that equation x = p*sopf(x) (where sopf(x) is the sum of distinct prime factors of x) has exactly n solutions in positive integers.
Terms
- a(0) =2a(1) =3a(2) =7a(3) =19a(4) =71a(5) =431a(6) =1259a(7) =4679a(8) =9719a(9) =23399a(10) =7559a(11) =42839a(12) =134399a(13) =181439a(14) =477359a(15) =241919a(16) =262079a(17) =453599
External references
- oeis: A336296