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 A092100 #8 Jul 21 2015 00:30:42
%S A092100 25,32,40,43,48,56,58,64,96,104,112,120,128,134,140,145,152,160,176,
%T A092100 185,192,208,212,224,235,240,244,248,252,256,264,272,280,286,288,292,
%U A092100 302,304,308,320,326,332,348,356,360,384,392,394,400
%N A092100 Smallest number of 1's in binary representations of primes between 2^n and 2^(n+1) is 4.
%C A092100 Where 4 appears in A091935.
%C A092100 This sequence differs from multiples of 8 (A008590) very little but significantly; even fewer are odd.
%C A092100 Essentially the same as A081504. - _R. J. Mathar_, Sep 08 2008
%t A092100 Compute the second line of the Mathematica code for A091936, then Do[ If[ Count[ IntegerDigits[ f[n], 2], 1] == 4, Print[n]], {n, 1, 400}] (* _Robert G. Wilson v_, Feb 19 2004 *)
%Y A092100 Cf. A091935, A091936.
%K A092100 nonn
%O A092100 1,1
%A A092100 _Robert G. Wilson v_, Feb 19 2004