This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A319022 #28 Sep 16 2018 12:03:19 %S A319022 2,119911,2510,21372,1943795,73171842,113678565,13121675970, %T A319022 297115923720,73605381139290,255360234137190,43759729761726090 %N A319022 a(n) is the smallest number with n distinct prime factors whose decimal representation contains all its prime factors, taking multiplicity into account. %C A319022 A version of A318965. %C A319022 If a term t is divisible by a prime power p^k, then p must appear at least k times in the decimal representation of t. The copies of p are allowed to overlap; however, in the first 12 terms of the sequence, this does not occur, and only a(2), a(4), and a(9) are nonsquarefree. %C A319022 a(n) >= A318965(n) by definition. If A318965(n) is squarefree, then a(n) = A318965(n). But a(n) = A318965(n) can also hold for a(n) that is nonsquarefree; e.g., a(4) = A318965(4). %e A319022 a(2) = 119911 = 11 * 11 * 991. %e A319022 a(3) = 2510 = 2 * 5 * 251. %e A319022 a(4) = 21372 = 2 * 2 * 3 * 13 * 137. %e A319022 a(5) = 1943795 = 5 * 7 * 19 * 37 * 79. %e A319022 a(6) = 73171842 = 2 * 3 * 17 * 31 * 73 * 317. %e A319022 a(7) = 113678565 = 3 * 5 * 7 * 11 * 13 * 67 * 113. %Y A319022 Cf. A083359, A131930, A318965. %K A319022 nonn,base,more %O A319022 1,1 %A A319022 _Altug Alkan_, Sep 08 2018 %E A319022 Terms computed by _Giovanni Resta_, Sep 08 2018