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 A261189 #18 Feb 13 2017 01:17:59
%S A261189 1,2,3,4,6,7,8,9,11,12,13,14,16,17,18,19,21,22,23,24,26,27,28,29,31,
%T A261189 32,33,34,36,37,38,39,41,42,43,44,46,47,48,49,61,62,63,64,66,67,68,69,
%U A261189 71,72,73,74,76,77,78,79,81,82,83,84,86,87,88,89,91,92,93,94,96,97,98,99,111,112,113,114,116,117,118,119,121
%N A261189 Integers such that no subsequence of decimal representation is divisible by 5.
%C A261189 Or, integers with no decimal digits 0 and 5 (see 2nd Mma).
%H A261189 Reinhard Zumkeller, <a href="/A261189/b261189.txt">Table of n, a(n) for n = 1..10000</a>
%H A261189 <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>.
%t A261189 (*1*)Reap[Do[Le=Length[id=IntegerDigits[n]];If[Min[Mod[Flatten[Table[FromDigits[Take[id,{x,y}]],{x,Le},{y,x,Le}]],5]]>0,Sow[n]],{n,199}]][[2,1]]
%t A261189 (*2*)Reap[Do[id=IntegerDigits[n];If[Intersection[id,{0,5}]== {},Sow[n]],{n,199}]][[2,1]]
%o A261189 (PARI) a(n)=fromdigits(apply(d->if(d>3,d+1,d), digits(n-1,8)))+1 \\ _Charles R Greathouse IV_, Aug 11 2015
%o A261189 (Haskell)
%o A261189 import Data.List.Ordered (isect)
%o A261189 a261189 n = a261189_list !! (n-1)
%o A261189 a261189_list = a052382_list `isect` a052413_list
%o A261189 -- _Reinhard Zumkeller_, Aug 13 2015
%Y A261189 Cf. A114922, A261188.
%Y A261189 Intersection of A052382 and A052413.
%K A261189 nonn,base,easy
%O A261189 1,2
%A A261189 _Zak Seidov_, Aug 11 2015