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 A138165 #9 Jul 07 2020 10:54:10
%S A138165 104869,108649,140689,140869,148609,164089,164809,168409,184609,
%T A138165 186049,401689,406981,408169,408691,409861,416089,418069,460189,
%U A138165 460891,460981,468019,468109,469801,480169,486091,489061,498061,601849,604189,604819
%N A138165 Prime numbers that contain each of the digits 0,1,4,6,8,9 exactly once.
%C A138165 There are 66 terms. Each product 2*3*5*7*a(n) is a squarefree number whose prime factorization (ignoring exponents) contains exactly one of each decimal digit, so each product is a term of A058909. (The primes 2,3,5,7 are the only single-digit primes in base 10.)
%H A138165 Rick L. Shepherd, <a href="/A138165/b138165.txt">Table of n, a(n) for n = 1..66</a> (full sequence)
%t A138165 Select[Prime[Range[10000,50000]],SequenceCount[DigitCount[#],{1,_,_,1,_,1,_,1,1,1}]>0&] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Jul 07 2020 *)
%Y A138165 Cf. A058909.
%K A138165 base,easy,fini,full,nonn
%O A138165 1,1
%A A138165 _Rick L. Shepherd_, Mar 03 2008