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 A367625 #11 Nov 28 2023 00:06:43 %S A367625 0,1,2,3,5,6,7,9,10,11,13,14,15,19,21,22,23,25,26,27,29,30,31,35,37, %T A367625 38,39,41,42,43,45,46,47,51,53,54,55,57,58,59,61,62,63,71,75,77,78,79, %U A367625 83,85,86,87,89,90,91,93,94,95,99,101,102,103,105,106,107,109,110,111,115,117,118,119,121,122,123,125,126,127 %N A367625 (A036991(n)-1)/2. %H A367625 N. J. A. Sloane, <a href="/A367625/b367625.txt">Table of n, a(n) for n = 2..13496</a> %o A367625 (Python) %o A367625 from itertools import count, islice %o A367625 def A367625_gen(startvalue=0): # generator of terms >= startvalue %o A367625 if startvalue <= 0: %o A367625 yield 0 %o A367625 for n in count(max(startvalue,1)): %o A367625 s = bin(n)[2:] %o A367625 c, l = 2, len(s) %o A367625 for i in range(1,l+1): %o A367625 c += int(s[l-i])<<1 %o A367625 if c <= i: %o A367625 break %o A367625 else: %o A367625 yield n %o A367625 A367625_list = list(islice(A367625_gen(),30)) # _Chai Wah Wu_, Nov 28 2023 %Y A367625 Cf. A036771, A367626, A367627. %K A367625 nonn %O A367625 2,3 %A A367625 _N. J. A. Sloane_, Nov 27 2023