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 A277009 #12 Sep 26 2016 20:45:53
%S A277009 3,7,11,14,15,19,23,27,29,30,31,35,39,43,46,47,51,55,59,60,61,62,63,
%T A277009 67,71,75,78,79,83,87,91,93,94,95,99,103,107,110,111,115,119,121,122,
%U A277009 123,124,125,126,127,131,135,139,142,143,147,151,155,157,158,159,163,167,171,174,175,179,183,187,188,189,190,191,195,199,203
%N A277009 Numbers not in range of A277012: numbers such that at least one run of 1-bits in their binary expansion is longer than 1 + the total number of 0-bits anywhere right of that run.
%C A277009 Numbers n for which A277007(n) > 0.
%C A277009 Numbers n for which A276077(A005940(1+n)) > 0.
%H A277009 Antti Karttunen, <a href="/A277009/b277009.txt">Table of n, a(n) for n = 1..10000</a>
%H A277009 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%e A277009 3 ("11" in binary, A007088) is present as the length of that only run of 1's is 2, and 2 > 1+0, where 0 is the total number of 0's to the right of that run.
%e A277009 60 ("111100" in binary) is present as 4 > 2+1.
%e A277009 246 ("11110110" in binary) is present as the length of the leftmost run of 1-bits is 4, and 4 > 1+2, where 2 is the total number of 0's located anywhere to the right of that run.
%o A277009 (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o A277009 (define A277009 (NONZERO-POS 1 0 A277007))
%Y A277009 Complement: A277008.
%Y A277009 Positions of nonzeros in A277007. Numbers not present in A277012.
%Y A277009 Cf. A007088, A005940, A276077, A276079.
%Y A277009 Differs from its subsequence A277019 for the first time at n=20, where a(20)=60, a term not present in A277019.
%K A277009 nonn,base
%O A277009 1,1
%A A277009 _Antti Karttunen_, Sep 25 2016