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 A007809 #27 May 27 2025 14:12:55
%S A007809 2,13,103,1039,10243,102359,1023467,10234589,102345689
%N A007809 Smallest prime with n distinct digits.
%D A007809 J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 1039, p.126, Ellipses, Paris 2008. [From _Lekraj Beedassy_, Oct 12 2008]
%t A007809 Table[Module[{k=NextPrime[10^n]},While[Max[DigitCount[k]]>1,k=NextPrime[k]];k],{n,0,8}] (* _Harvey P. Dale_, May 27 2025 *)
%o A007809 (PARI) A007809(n,p=A038378(n))={until(isprime(p),while(#Set(digits(p++))<n,));p} \\ _M. F. Hasler_, May 04 2017
%o A007809 (Python)
%o A007809 from sympy import nextprime
%o A007809 def a(n):
%o A007809 p = nextprime(10**(n-1))
%o A007809 while len(set(str(p))) < n: p = nextprime(p)
%o A007809 return p
%o A007809 for n in range(1, 10):
%o A007809 print(a(n), end=", ") # _Michael S. Branicky_, Feb 13 2021
%Y A007809 Cf. A038378, A007810, A071360, A071361, A071362, A071363.
%K A007809 nonn,fini,base,full
%O A007809 1,1
%A A007809 N.B. Backhouse (sx52(AT)liverpool.ac.uk)
%E A007809 Corrected by _Jud McCranie_, Jan 03 2001