login

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”).

Numbers that have at least two non-overlapping pairs of consecutive ones in their binary representation.
0

%I #38 Dec 25 2022 14:14:42

%S 15,27,30,31,47,51,54,55,59,60,61,62,63,79,91,94,95,99,102,103,107,

%T 108,109,110,111,115,118,119,120,121,122,123,124,125,126,127,143,155,

%U 158,159

%N Numbers that have at least two non-overlapping pairs of consecutive ones in their binary representation.

%C These are the numbers for which the smallest Hamming distance to a fibbinary number is larger than 1.

%H Wikipedia, <a href="https://en.m.wikipedia.org/wiki/Hamming_distance">Hamming distance</a>

%H Wikipedia, <a href="https://en.m.wikipedia.org/wiki/Fibbinary_number">Fibbinary number</a>

%e 27 is 11011 in binary, thus it is in the sequence.

%e 14 is 1110 in binary. The pairs of consecutive ones overlap, so it is not in the sequence.

%t n=10;

%t a=Range[2^n];

%t fib=Select[a, BitAnd[#,2#]==0&];

%t nonadj=Complement[a,Union@@Outer[BitXor,fib,2^#&/@Range[n]]]

%Y Cf. A003714.

%K nonn,base,easy

%O 1,1

%A _Elijah Beregovsky_, Dec 23 2022