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 Oct 21 2024 17:30:49
%S 3,6,7,12,14,15,24,27,28,30,31,48,51,54,55,56,59,60,62,63,96,99,102,
%T 103,108,110,111,112,115,118,119,120,123,124,126,127,192,195,198,199,
%U 204,206,207,216,219,220,222,223,224,227,230,231,236,238,239,240,243,246
%N A positive integer n is included if every 1 in binary n is next to at least one other 1.
%C n is included if A144790(n) >= 2.
%C A173024 is a subsequence. - _Reinhard Zumkeller_, Feb 07 2010
%H Michael De Vlieger, <a href="/A144795/b144795.txt">Table of n, a(n) for n = 1..10000</a>
%p isA144795 := proc(n) local bind,i ; bind := convert(n,base,2) ; for i from 1 to nops(bind) do if i = 1 then if op(i,bind) = 1 and op(i+1,bind) = 0 then RETURN(false) : fi; elif i = nops(bind) then if op(i,bind) = 1 and op(i-1,bind) = 0 then RETURN(false) : fi; else if op(i,bind) = 1 and op(i-1,bind) = 0 and op(i+1,bind) = 0 then RETURN(false) : fi; fi; od: RETURN(true) ; end: for n from 3 to 400 do if isA144795(n) then printf("%d,",n) ; fi; od: # _R. J. Mathar_, Sep 29 2008
%t Select[Range@ 250, AllTrue[Map[Length, Select[Split@ IntegerDigits[#, 2], First@ # == 1 &]], # > 1 &] &] (* _Michael De Vlieger_, Aug 20 2017 *)
%Y Cf. A144790, A144794.
%Y Cf. A004760, A173022, A005251, A173025. - _Reinhard Zumkeller_, Feb 07 2010
%Y Complement of A377169.
%K base,nonn
%O 1,1
%A _Leroy Quet_, Sep 21 2008
%E Extended by _R. J. Mathar_, Sep 29 2008