id:A109608 - OEIS Search Results

Search: id:A109608

Displaying 1-1 of 1 results found.

page 1

Numbers n such that the number of digits required to write the prime factors of n equals the number of digits of n.

+0
1

2, 3, 5, 7, 10, 11, 13, 14, 15, 17, 19, 21, 23, 25, 29, 31, 35, 37, 41, 43, 47, 49, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 105, 106, 107, 109, 111, 113, 115, 118, 119, 122, 123, 125, 127, 129, 131, 133, 134, 137, 139, 141, 142, 145, 146, 147, 149, 151, 155 (list; graph; listen)

	OFFSET	`1,1`
	EXAMPLE	`18775 is a term because it is a 5-digit number with 5 digits in its` `factorization: 55751 = 18775.`
	CROSSREFS	`Cf. A076649.` `Adjacent sequences: A109605 A109606 A109607 this_sequence A109609 A109610 A109611` `Sequence in context: A121232 A122428 A087246 this_sequence A118241 A002269 A047487`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Jul 31 2005`

page 1

Search completed in 0.002 seconds

Last modified November 8 20:39 EST 2009. Contains 166234 sequences.

AT&T Labs Research