%I A092111
%S A092111 0,0,1,0,1,0,1,1,1,1,1,0,1,2,1,0,1,0,1,1,1,2,1,1,1,2,1,1,1,0,1,1,1,1,1,
%T A092111 2,1,2,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1,2,1,1,2,1,1,0,1,2,1,1,1,1,1,1,1,2,
%U A092111 1,1,1,1,1,1,1,2,1,1,2,1,1,1,1,1,1,0,1,2,1,1,1,2,1,1,1,1,1,1,1,1,1,1,1
%N A092111 n+1 less the greatest number of 1's in binary representations of primes 
               between 2^n and 2^(n+1).
%C A092111 0's occur only at Mersenne prime exponents (A000043) -1, twos are in 
               A092112, threes do not appear < 504.
%F A092111 n+1 - A091937.
%t A092111 Compute the second line of the Mathematica code for A091938, then (Table[n 
               + 1, {n, 105}]) - (Count[ IntegerDigits[ #, 2], 1] & /@ Table[ f[n], 
               {n, 105}])
%Y A092111 Cf. A091938, A092112.
%Y A092111 Sequence in context: A073368 A037889 A098055 this_sequence A050317 A141095 
               A159195
%Y A092111 Adjacent sequences: A092108 A092109 A092110 this_sequence A092112 A092113 
               A092114
%K A092111 nonn
%O A092111 1,14
%A A092111 Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 20 2004