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 A036311 #28 May 18 2022 07:56:48
%S A036311 4,8,10,16,20,25,32,40,50,64,80,100,125,128,160,200,250,256,320,400,
%T A036311 500,512,625,640,800,1000,1024,1250,1280,1600,2000,2048,2500,2560,
%U A036311 3125,3200,4000,4096,5000,5120,6250,6400,8000,8192,10000,10240,12500,12800
%N A036311 Composite numbers whose prime factors contain no digits other than 2 and 5.
%C A036311 A003592 with 1, 2 and 5 removed. - _Robert Israel_, Apr 29 2018
%H A036311 Robert Israel, <a href="/A036311/b036311.txt">Table of n, a(n) for n = 1..10000</a> (first 131 terms from Vincenzo Librandi)
%H A036311 <a href="/index/Pri#prime_factors">Index entries for sequences related to prime factors</a>.
%F A036311 Sum_{n>=1} 1/a(n) = 4/5. - _Amiram Eldar_, May 18 2022~
%p A036311 N:= 20000: # to get all terms <= N
%p A036311 S:= {seq(seq(2^i*5^j,i=0..ilog2(N/5^j)),j=0..floor(log[5](N)))} minus {1,2,5}:
%p A036311 sort(convert(S,list)); # _Robert Israel_, Apr 29 2018
%t A036311 dpfQ[n_]:=Module[{d=Union[Flatten[IntegerDigits/@Transpose[FactorInteger[n]][[1]]]]}, !PrimeQ[n]&&(d == {2}||d == {5}||d == {2, 5})]; Select[Range[15000], dpfQ] (* _Vincenzo Librandi_, Aug 25 2013 *)
%o A036311 (Magma) [n: n in [4..13000] | not IsPrime(n) and forall{f: f in PrimeDivisors(n) | Intseq(f) subset [2,5]}]; // _Bruno Berselli_, Aug 26 2013
%Y A036311 Cf. A003592, A036302-A036325, A025612.
%K A036311 nonn,easy,base
%O A036311 1,1
%A A036311 _Patrick De Geest_, Dec 15 1998