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 A093684 #19 May 21 2016 03:06:28
%S A093684 1,1,1,1,0,1,1,1,1,1,0,3,0,1,0,2,0,1,1,1,1,2,3,2,2,2,1,1,1,3,0,2,1,3,
%T A093684 1,1,0,1,2,2,3,3,1,1,1,1,2,2,4,3,3,3,2,2,0,3,1,5,5,6,4,1,5,2,3,2,2,4,
%U A093684 1,1,1,4,1,1,1,2,3,3,4,5,0,3,2,1,4,3,4,5,3,2,1,2,3,3,3,3,6,2,3,4,4,2
%N A093684 In binary representation: number of occurrences of n in n!.
%C A093684 a(A093685(n)) = 0, a(A093686(n)) > 0.
%H A093684 Robert Israel, <a href="/A093684/b093684.txt">Table of n, a(n) for n = 1..10000</a>
%H A093684 <a href="/index/Fa#factorial">Index entries for sequences related to factorial numbers</a>.
%H A093684 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%e A093684 n=12->'1100', 12!=479001600->'11100100011001111110000000000' with three occurrences of '1100': '.1100....1100....1100........', therefore a(12)=3.
%p A093684 f:= proc(n) local L,Lf;
%p A093684 L:= convert(convert(n,binary),string);
%p A093684 Lf:= convert(convert(n!,binary),string);
%p A093684 nops([StringTools:-SearchAll(L,Lf)])
%p A093684 end proc:
%p A093684 map(f, [$1..100]); # _Robert Israel_, May 20 2016
%t A093684 non[n_]:=Module[{b=IntegerDigits[n,2],f=IntegerDigits[n!,2]}, Length[ Select[ Partition[ f,Length[b],1],#==b&]]]; Array[non,110] (* _Harvey P. Dale_, Jun 04 2014 *)
%Y A093684 Cf. A036603, A007088, A000142, A092601.
%K A093684 nonn
%O A093684 1,12
%A A093684 _Reinhard Zumkeller_, Apr 10 2004