id:A109600 - OEIS Search Results

Search: id:A109600

Displaying 1-1 of 1 results found.

page 1

Numbers n such that number of 1's in binary representation of n equals the number of digits required to write the prime factors of n.

+0
1

2, 6, 9, 10, 17, 22, 26, 28, 38, 42, 50, 54, 60, 69, 70, 74, 78, 82, 90, 92, 98, 99, 102, 114, 116, 131, 133, 134, 135, 137, 145, 146, 150, 153, 154, 161, 165, 169, 170, 172, 193, 194, 195, 202, 209, 210, 212, 220, 225, 226, 234, 242, 248, 259, 265, 275, 278, 282 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`708588 has 13 1's in base 2 and 13 digits in its factorization. What is the next term in this sequence with more 1's and digits?`
	EXAMPLE	`54=110110 in base 2 and 54=233*3, hence 54 is in the sequence.`
	CROSSREFS	`Cf. A076649.` `Adjacent sequences: A109597 A109598 A109599 this_sequence A109601 A109602 A109603` `Sequence in context: A047396 A085304 A015843 this_sequence A071814 A066586 A133160`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Jul 30 2005`

page 1

Search completed in 0.002 seconds

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.

AT&T Labs Research