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