|
Search: id:A066329
|
|
|
| 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. |
|
+0
2
|
|
| 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
(list; graph; listen)
|
|
|
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: A037693 A098611 A090337 this_sequence A001738 A120655 A018203
Adjacent sequences: A066326 A066327 A066328 this_sequence A066330 A066331 A066332
|
|
KEYWORD
|
easy,sign
|
|
AUTHOR
|
George E. Antoniou (george.antoniou(AT)montclair.edu), Dec 15 2001
|
|
EXTENSIONS
|
More terms from Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), Jun 21 2006
|
|
|
Search completed in 0.002 seconds
|
