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 A069715 #12 Feb 13 2017 02:17:07
%S A069715 1,10,11,12,13,14,15,16,17,18,19,21,23,25,27,29,31,32,34,35,37,38,41,
%T A069715 43,45,47,49,51,52,53,54,56,57,58,59,61,65,67,71,72,73,74,75,76,78,79,
%U A069715 81,83,85,87,89,91,92,94,95,97,98,100,101,102,103,104,105,106,107,108
%N A069715 GCD of digits of n is 1.
%H A069715 Reinhard Zumkeller, <a href="/A069715/b069715.txt">Table of n, a(n) for n = 1..10000</a>
%H A069715 <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>.
%F A069715 A052423(a(n)) = 1. - _Reinhard Zumkeller_, Apr 14 2014
%F A069715 a(n) ~ n. In fact a(n) = n + O(n^(log 5/log 10)). - _Charles R Greathouse IV_, Nov 01 2014
%e A069715 All numbers with at least one digit equal to 1 are here.
%t A069715 Do[s=Apply[GCD, IntegerDigits[n]]; If[Equal[s, 1], Print[n]], {n, 1, 256}]
%o A069715 (Haskell)
%o A069715 a069715 n = a069715_list !! (n-1)
%o A069715 a069715_list = filter ((== 1) . a052423) [1..]
%o A069715 -- _Reinhard Zumkeller_, Apr 14 2014
%o A069715 (PARI) is(n)=gcd(digits(n))==1 \\ _Charles R Greathouse IV_, Nov 01 2014
%Y A069715 Cf. A011531 (subsequence), A240913 (subsequence).
%K A069715 base,easy,nonn
%O A069715 1,2
%A A069715 _Labos Elemer_, Apr 02 2002