[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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.
1
0, 1, 11, 100, 101, 1000, 1001, 1011, 1100, 1101, 1111, -1, -1, -1, -1, -1, 10000, 10001, 10011, 10100, 10101, 11000, 11001, 11011, 11100, 11101, 11111, -1, -1, -1, -1, -1, 100000, 100001, 100011, 100100, 100101, 101000, 101001, 101011, 101100, 101101, 101111, -1, -1, -1, -1, -1, 110000, 110001, 110011
OFFSET
0,3
REFERENCES
John M. Yarbrough, Digital Logic Applications and Design, West Publishing, 1997, p. 26
CROSSREFS
Cf. A066335.
A120631 is the decimal conversion of these binary strings.
Sequence in context: A287984 A261757 A280049 * A309870 A219896 A330898
KEYWORD
easy,sign
AUTHOR
George E. Antoniou, Dec 15 2001
EXTENSIONS
More terms from Joshua Zucker, Jun 21 2006
STATUS
approved