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 A240913 #8 Dec 17 2014 15:18:35
%S A240913 23,25,27,29,32,34,35,37,38,43,45,47,49,52,53,54,56,57,58,59,65,67,72,
%T A240913 73,74,75,76,78,79,83,85,87,89,92,94,95,97,98,203,205,207,209,223,225,
%U A240913 227,229,230,232,233,234,235,236,237,238,239,243,245,247,249
%N A240913 Numbers m such that GCD of digits of m is 1 and no digit of m is 1.
%C A240913 A052423(a(n)) = 1.
%H A240913 Reinhard Zumkeller, <a href="/A240913/b240913.txt">Table of n, a(n) for n = 1..10000</a>
%t A240913 gcdQ[n_]:=Module[{idn=IntegerDigits[n]},!MemberQ[idn,1]&&GCD@@idn==1]; Select[ Range[300],gcdQ] (* _Harvey P. Dale_, Dec 17 2014 *)
%o A240913 (Haskell)
%o A240913 a240913 n = a240913_list !! (n-1)
%o A240913 a240913_list = filter (not . elem '1' . show) a069715_list
%o A240913 (PARI) is(n)=my(d=Set(digits(n))); setsearch(d,1)==0 && gcd(d)==1 \\ _Charles R Greathouse IV_, Nov 01 2014
%Y A240913 Subsequence of A069715.
%K A240913 nonn,base
%O A240913 1,1
%A A240913 _Reinhard Zumkeller_, Apr 14 2014