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 A103679 #31 Apr 03 2025 02:52:39
%S A103679 0,1,2,3,4,5,7,8,9,10,11,12,13,14,15,16,17,18,19,21,22,24,25,26,27,28,
%T A103679 29,33,34,35,36,38,39,40,41,42,44,45,46,47,48,49,50,51,52,54,56,57,59,
%U A103679 60,61,62,63,64,66,67,68,69,70,72,73,75,76,77,78,79,80,82,83,84,85,87
%N A103679 Numbers m such that the binary representation of m! does not contain 6!.
%C A103679 Last term is probably 802. No numbers between 803 and 500000 belong to the sequence. - _Giovanni Resta_, Apr 07 2013
%H A103679 Amiram Eldar, <a href="/A103679/b103679.txt">Table of n, a(n) for n = 1..167</a>
%H A103679 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>.
%H A103679 <a href="/index/Fa#factorial">Index entries for sequences related to factorial numbers</a>.
%F A103679 A103674(a(n)) = 0, A103674(A103678(n)) = 1.
%t A103679 Select[Range[0,100],SequenceCount[IntegerDigits[#!,2],{1,0,1,1,0,1,0,0,0,0}]==0&] (* _Harvey P. Dale_, Oct 12 2024 *)
%o A103679 (PARI) is(n)=n=n!; while(n>719, my(e=valuation(n, 2), e1=valuation((n>>=e)+1, 2)); n>>=e1; if(e>3 && e1==1 && bitand(n, 31)==22, return(0))); 1 \\ _Charles R Greathouse IV_, Apr 07 2013
%Y A103679 Complement of A103678.
%Y A103679 Cf. A000142, A007088, A036603, A102730, A103674, A103677, A103680, A103681.
%K A103679 nonn,base
%O A103679 1,3
%A A103679 _Reinhard Zumkeller_, Feb 12 2005