Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #15 Mar 29 2013 16:45:35
%S 0,3,6,11,12,13,15,19,22,24,25,26,27,30,35,38,43,44,45,47,48,49,50,51,
%T 52,53,54,60,61,63,67,70,75,76,77,79,83,86,88,89,90,91,94,96,97,98,99,
%U 100,101,102,104,105,106,107,108,109,111,120,121,122,123,126
%N Numbers for which the maximal run of 1's in their binary representation contains even number of 1's.
%C We call these numbers "maxevil". The sequence is complement to A223909.
%C If a(n) is in the sequence, then 2^k*a(n) is in the sequence. If a(n)==0 (mod 4) is in the sequence, then a(n)+1 is in the sequence. If a(n)==0 (mod 8) is in the sequence, then a(n)+1, a(n)+2 are in the sequence. If a(n)==0 (mod 16) is in the sequence, then numbers a(n)+i, i<=6, are in the sequence.
%H Peter J. C. Moses, <a href="/A223910/b223910.txt">Table of n, a(n) for n = 1..10000</a>
%t Select[Range[0,200],EvenQ[Max[Map[Count[#,1]&,Split[IntegerDigits[#,2]]]]]&] (* _Peter J. C. Moses_, Mar 29 2013 *)
%Y Cf. A223909, A000069, A001969.
%K nonn,base
%O 1,2
%A _Vladimir Shevelev_, Mar 29 2013