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 A003607 M2612 #42 Dec 16 2024 08:19:58 %S A003607 0,3,7,8,10,14,19,20,21,23,24,27,29,31,36,37,40,45,51,52,53,54,56,57, %T A003607 58,61,62,64,66,67,71,73,74,76,78,81,84,86,92,93,94,97,98,102,104,107, %U A003607 113,114,118,124,131,132,133,134,135,137,138,139,140,143,144 %N A003607 Location of 0's when natural numbers are listed in binary. %D A003607 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A003607 Reinhard Zumkeller, <a href="/A003607/b003607.txt">Table of n, a(n) for n = 0..10000</a> %F A003607 A030190(a(n)) = 0. [_Reinhard Zumkeller_, Dec 11 2011] %t A003607 Position[IntegerDigits[Range[0, 100], 2] // Flatten, 0] - 1 // Flatten (* _Jean-François Alcover_, Oct 06 2016 *) %o A003607 (Haskell) %o A003607 import Data.List (elemIndices) %o A003607 a003607 n = a003607_list !! n %o A003607 a003607_list = elemIndices 0 a030190_list %o A003607 -- _Reinhard Zumkeller_, Dec 11 2011 %o A003607 (Python) %o A003607 from itertools import count, islice %o A003607 def A003607_gen(): # generator of terms %o A003607 return (i for i, s in enumerate(d for n in count(0) for d in bin(n)[2:]) if s == '0') %o A003607 A003607_list = list(islice(A003607_gen(),30)) # _Chai Wah Wu_, Feb 18 2022 %Y A003607 Cf. A030190, A030302, A030303, A030306, A056062. %K A003607 nonn,base %O A003607 0,2 %A A003607 _N. J. A. Sloane_ and _Mira Bernstein_