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 A003796 #30 Feb 13 2022 06:38:21
%S A003796 0,1,2,3,4,5,6,7,9,10,11,12,13,14,15,18,19,20,21,22,23,25,26,27,28,29,
%T A003796 30,31,36,37,38,39,41,42,43,44,45,46,47,50,51,52,53,54,55,57,58,59,60,
%U A003796 61,62,63,73,74,75,76,77,78,79,82,83,84,85,86,87,89,90,91,92
%N A003796 Numbers with no 3 adjacent 0's in binary expansion.
%H A003796 Reinhard Zumkeller, <a href="/A003796/b003796.txt">Table of n, a(n) for n = 1..10000</a>
%H A003796 Robert Baillie and Thomas Schmelzer, <a href="https://library.wolfram.com/infocenter/MathSource/7166/">Summing Kempner's Curious (Slowly-Convergent) Series</a>, Mathematica Notebook kempnerSums.nb, Wolfram Library Archive, 2008.
%H A003796 David Garth and Adam Gouge, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL10/Garth/garth14.html">Affinely Self-Generating Sets and Morphisms</a>, Journal of Integer Sequences, Vol. 10 (2007), Article 07.1.5.
%H A003796 Chai Wah Wu, <a href="https://arxiv.org/abs/1810.02293">Record values in appending and prepending bitstrings to runs of binary digits</a>, arXiv:1810.02293 [math.NT], 2018.
%H A003796 <a href="/index/Ar#2-automatic">Index entries for 2-automatic sequences</a>.
%F A003796 Sum_{n>=2} 1/a(n) = 9.829256652701616366441622119246549956902006567009112470631751387637507184399... (calculated using Baillie and Schmelzer's kempnerSums.nb, see Links). - _Amiram Eldar_, Feb 13 2022
%t A003796 Select[Range[0,100],SequenceCount[IntegerDigits[#,2],{0,0,0}]==0&] (* The program uses the SequenceCount function from Mathematica version 10 *) (* _Harvey P. Dale_, Sep 12 2015 *)
%o A003796 (Haskell)
%o A003796 a003796 n = a003796_list !! (n-1)
%o A003796 a003796_list = filter f [0..] where
%o A003796 f x = x < 4 || x `mod` 8 /= 0 && f (x `div` 2)
%o A003796 -- _Reinhard Zumkeller_, Jul 01 2013
%o A003796 (PARI) is(n)=while(n>7,if(bitand(n,7)==0,return(0));n>>=1); 1 \\ _Charles R Greathouse IV_, Feb 11 2017
%Y A003796 Complement of A004779.
%Y A003796 Cf. A004745 (no 001), A004746 (no 010), A004744 (no 011), A003754 (no 100), A004742 (no 101), A004743 (no 110), A003726 (no 111).
%Y A003796 Cf. A063037, A007088.
%K A003796 nonn,base,easy
%O A003796 1,3
%A A003796 _N. J. A. Sloane_