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 A004753 #23 Oct 26 2023 01:07:34
%S A004753 4,8,9,12,16,17,18,19,20,24,25,28,32,33,34,35,36,37,38,39,40,41,44,48,
%T A004753 49,50,51,52,56,57,60,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,
%U A004753 80,81,82,83,84,88,89,92,96,97,98,99,100,101,102,103,104,105
%N A004753 Numbers whose binary expansion contains 100.
%H A004753 T. D. Noe, <a href="/A004753/b004753.txt">Table of n, a(n) for n = 1..1000</a>
%H A004753 <a href="/index/Ar#2-automatic">Index entries for 2-automatic sequences</a>.
%F A004753 a(n) ~ n. - _Charles R Greathouse IV_, Sep 24 2012
%t A004753 Select[Range[110],MemberQ[Partition[IntegerDigits[#,2],3,1],{1,0,0}]&] (* _Harvey P. Dale_, Mar 14 2014 *)
%o A004753 (Haskell)
%o A004753 a004753 n = a004753_list !! (n-1)
%o A004753 a004753_list = filter f [0..] where
%o A004753 f 0 = False; f x = x `mod` 4 == 0 || f (x `div` 2)
%o A004753 -- _Reinhard Zumkeller_, Oct 27 2011
%o A004753 (PARI) is(n)=n=binary(n);for(i=3,#n,if(n[i-2]&&!n[i]&&!n[i-1],return(1)));0 \\ _Charles R Greathouse IV_, Sep 24 2012
%o A004753 (PARI) is(n)=while(n>3, if(bitand(n,7)==4, return(1)); n>>=1); 0 \\ _Charles R Greathouse IV_, Feb 11 2017
%Y A004753 Complement of A003754.
%Y A004753 Subsequence of A247875.
%Y A004753 Cf. A004748, A004749, A004750, A004752.
%K A004753 nonn,easy
%O A004753 1,1
%A A004753 _N. J. A. Sloane_