|
Search: id:A066335
|
|
|
| A066335 |
|
Binary string which equals n when 1's and 2's bits have negative weights. |
|
+0
6
|
|
| 0, 111, 110, 101, 100, 1011, 1010, 1001, 1000, 1111, 1110, 1101, 1100, 10011, 10010, 10001, 10000, 10111, 10110, 10101, 10100, 11011, 11010, 11001, 11000, 11111, 11110, 11101, 11100, 100011, 100010, 100001, 100000, 100111, 100110, 100101
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
Morris M. Mano, Digital Design, Prentice Hall, 2002. p. 20.
|
|
EXAMPLE
|
For example: 4-2-1 = 1, so a(1) = 111; 4-2+0 = 2 so a(2) = 110; 4+0-1 = 3 so a(3) = 101; 4+0+0 = 4 so a(4) = 100, etc.
|
|
CROSSREFS
|
A120634 is the decimal equivalent of these numbers in binary.
Adjacent sequences: A066332 A066333 A066334 this_sequence A066336 A066337 A066338
Sequence in context: A123727 A072807 A073502 this_sequence A107844 A084504 A134554
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
George E. Antoniou (george.antoniou(AT)montclair.edu), Dec 15 2001
|
|
EXTENSIONS
|
More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Jan 28 2003
Corrected and extended by Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), Jun 21 2006
|
|
|
Search completed in 0.002 seconds
|
