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 A038365 #14 Nov 21 2013 12:46:44
%S A038365 1,2,3,4,5,6,7,8,9,11,13,14,15,16,17,18,19,22,23,27,28,29,31,32,33,34,
%T A038365 35,36,38,39,41,43,44,45,46,48,52,53,54,55,56,57,58,59,64,65,66,67,69,
%U A038365 72,73,76,77,78,79,82,83,85,86,88,92,93,94,111,113,114,115,116,117,118
%N A038365 Numbers n with property that digits of n are not present in 2n.
%C A038365 207 is the smallest number containing a zero, cf. A192825. [_Reinhard Zumkeller_, Aug 09 2011]
%H A038365 T. D. Noe, <a href="/A038365/b038365.txt">Table of n, a(n) for n=1..2000</a>
%e A038365 36 is in the list since 2*36=72, which shares no digit with 36.
%t A038365 Select[Range[140],Intersection[IntegerDigits[2 #], IntegerDigits[#]] =={}&] (* _Harvey P. Dale_, Apr 30 2011 *)
%o A038365 (Haskell)
%o A038365 import Data.List (intersect)
%o A038365 a038365 n = a038365_list !! (n-1)
%o A038365 a038365_list = filter (\x -> null (show (2*x) `intersect` show x)) [1..]
%o A038365 -- _Reinhard Zumkeller_, Aug 09 2011
%Y A038365 Cf. A129845 (complement).
%K A038365 nonn,easy,base,nice
%O A038365 1,2
%A A038365 _Erich Friedman_