id:A066334 - OEIS Search Results

Search: id:A066334

Displaying 1-1 of 1 results found.

page 1

Binary string which equals n when 1's, 2's, 4's and 8's bits have weights 1, 2, 4, 2 respectively, while the other bits have their usual weights. -1 if no such string exists.

+0
2

0, 1, 10, 11, 100, 101, 110, 111, 1110, 1111, -1, -1, -1, -1, -1, -1, 10000, 10001, 10010, 10011, 10100, 10101, 10110, 10111, 11110, 11111, -1, -1, -1, -1, -1, -1, 100000, 100001, 100010, 100011, 100100, 100101, 100110, 100111, 101110, 101111, -1, -1, -1, -1, -1, -1, 110000, 110001, 110010, 110011 (list; graph; listen)

	OFFSET	`0,3`
	REFERENCES	`Morris M. Mano, Digital Design, Prentice Hall, 2002. p. 20.`
	CROSSREFS	`Cf. A066335.` `Sequence in context: A136813 A038102 A115846 this_sequence A136829 A136832 A136808` `Adjacent sequences: A066331 A066332 A066333 this_sequence A066335 A066336 A066337`
	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`

page 1

Search completed in 0.002 seconds

Last modified December 20 16:54 EST 2009. Contains 171081 sequences.

AT&T Labs Research