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 A066329 #5 Feb 03 2020 15:25:25 %S A066329 0,1,11,100,101,1000,1001,1011,1100,1101,1111,-1,-1,-1,-1,-1,10000, %T A066329 10001,10011,10100,10101,11000,11001,11011,11100,11101,11111,-1,-1,-1, %U A066329 -1,-1,100000,100001,100011,100100,100101,101000,101001,101011,101100,101101,101111,-1,-1,-1,-1,-1,110000,110001,110011 %N A066329 Binary string which equals n when 1's, 2's, 4's and 8's bits have weights 1, 1, 3, 5 respectively, while the other bits have their usual weights. -1 if no such string exists. %D A066329 John M. Yarbrough, Digital Logic Applications and Design, West Publishing, 1997, p. 26 %Y A066329 Cf. A066335. %Y A066329 A120631 is the decimal conversion of these binary strings. %K A066329 easy,sign %O A066329 0,3 %A A066329 _George E. Antoniou_, Dec 15 2001 %E A066329 More terms from _Joshua Zucker_, Jun 21 2006