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 A070034 #12 Aug 04 2021 12:27:41
%S A070034 1,2,4,6,8,16,19,20,21,27,32,35,36,39,40,42,44,52,64,67,68,72,73,79,
%T A070034 80,88,92,101,104,109,116,128,131,132,136,137,141,144,145,146,150,159,
%U A070034 160,176,177,185,188,202,204,208,209,233,244,256,259,260,264,265
%N A070034 Numbers n such that n! reduced modulo 2^n is also a power of 2.
%H A070034 T. D. Noe, <a href="/A070034/b070034.txt">Table of n, a(n) for n = 1..800</a>
%F A070034 Mod[a(n)!, 2^a(n)] = A068496(n) = 2^w for some integer w.
%e A070034 Not rarely,consecutive integers are in the sequence like {19,20,21}, providing residues {65536,262144,262144}.
%t A070034 t = {}; Do[s=Mod[n!, 2^n]; If[IntegerQ[Log[2, s]], AppendTo[t, n]], {n, 300}]; t
%t A070034 Select[Range[300],IntegerQ[Log2[Mod[#!,2^#]]]&] (* _Harvey P. Dale_, Aug 04 2021 *)
%Y A070034 Cf. A000142, A000079, A068496.
%K A070034 nonn
%O A070034 1,2
%A A070034 _Labos Elemer_, Apr 17 2002