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 A093685 #13 May 01 2021 13:13:37
%S A093685 0,5,11,13,15,17,31,37,55,81,164,395,513,517,619,1041,1287,1538,2108,
%T A093685 2116,2137,2138,2282,2352,2363,2432,2466,2524,4278,4511,4758,4766,
%U A093685 4852,4854,5136,5586,8396,8463,8883,9707,10351,16528,17279,19469,21244,24472
%N A093685 In binary representation: numbers not occurring in their factorial.
%C A093685 A093684(a(n)) = 0, complement of A093686.
%e A093685 5! = 1*2*3*4*5 = 120 -> '1111000', in which '101'=5 is not contained, so 5 is in the sequence.
%t A093685 f[n_] := ToString[ FromDigits[ IntegerDigits[n, 2]]]; Select[ Range[ 29000], StringPosition[ f[ #! ], f[ # ]] == {} &] (* _Robert G. Wilson v_, Apr 15 2004 *)
%o A093685 (Python)
%o A093685 def aupto(limit):
%o A093685 kfact, alst = 1, [0]
%o A093685 for k in range(1, limit+1):
%o A093685 kb, kfact = bin(k)[2:], kfact * k
%o A093685 kfactb = bin(kfact)[2:]
%o A093685 if kb not in kfactb: alst.append(k)
%o A093685 return alst
%o A093685 print(aupto(25000)) # _Michael S. Branicky_, May 01 2021
%Y A093685 Cf. A036603, A007088, A000142, A093826.
%K A093685 nonn,base
%O A093685 1,2
%A A093685 _Reinhard Zumkeller_, Apr 10 2004
%E A093685 More terms from _Robert G. Wilson v_, Apr 15 2004