a(n) is the least number k such that the number of distinct digits in the prime factorization of k is n (counting terms of the form p^1 as p).
A254317
a(n) is the least number k such that the number of distinct digits in the prime factorization of k is n (counting terms of the form p^1 as p).
Terms
- a(0) =1a(1) =6a(2) =26a(3) =102a(4) =510a(5) =3210a(6) =22890a(7) =153690a(8) =1507290a(9) =15618090
External references
- oeis: A254317