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 A166571 #18 Jun 20 2014 09:20:44
%S A166571 101,103,107,109,1009,1013,1019,1021,1031,1033,1039,1049,1051,1061,
%T A166571 1063,1069,1087,1091,1093,1097,1103,1109,3109,5101,5107,6101,7103,
%U A166571 7109,8101,9103,9109,10007,10009,10037,10039,10061,10067,10069,10079,10091,10093
%N A166571 Prime numbers containing the string 10.
%H A166571 Vincenzo Librandi, <a href="/A166571/b166571.txt">Table of n, a(n) for n = 1..1000</a>
%F A166571 a(n) ~ n log n. - _Charles R Greathouse IV_, Jun 20 2014
%t A166571 p10Q[n_] := Module[{idn = IntegerDigits[n]}, MemberQ[Partition[idn, 2, 1], {1, 0}]]; Select[Prime[Range[1250]], p10Q] (* _Vincenzo Librandi_, Sep 14 2012 *)
%o A166571 (PARI) contains(n,k)=my(N=digits(n),K=digits(k)); for(i=0,#N-#K, for(j=1,#K,if(N[i+j]!=K[j],next(2))); return(1)); 0
%o A166571 is(n)=isprime(n) && contains(n,10) \\ _Charles R Greathouse IV_, Jun 20 2014
%Y A166571 Cf. A166572, A166573, A166579, A166580, A166581, A166582.
%K A166571 nonn,base
%O A166571 1,1
%A A166571 _Vincenzo Librandi_, Nov 01 2009
%E A166571 Corrected (1087 inserted) by _R. J. Mathar_, Nov 30 2009