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 A259146 #28 Feb 13 2021 14:11:04 %S A259146 2,13,103,1039,10243,102359,1023467,10234589,102345689,10234567897 %N A259146 Smallest prime with first n digits distinct. %C A259146 The sequence is complete: n=1..10. %F A259146 a(n) = A007809(n), n<=9. - _R. J. Mathar_, Jul 06 2015 %o A259146 (Python) %o A259146 from sympy import nextprime %o A259146 def a(n): %o A259146 p = nextprime(10**(n-1)) %o A259146 while len(set(str(p)[:n])) < n: p = nextprime(p) %o A259146 return p %o A259146 for n in range(1, 11): %o A259146 print(a(n), end=", ") # _Michael S. Branicky_, Feb 13 2021 %Y A259146 Cf. A000040, A007809, A007810, A029743. %K A259146 nonn,base,fini,full %O A259146 1,1 %A A259146 _Zak Seidov_, Jun 19 2015