id:A108871 - OEIS Search Results

Search: id:A108871

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 is equal to the number of divisors of n.

+0
1

11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 143, 187, 202, 206, 209, 214, 218, 221, 226, 247, 253, 254, 262, 274, 278, 298, 299, 302, 303, 309, 314, 319, 321, 323, 326, 327, 334, 339, 341, 346, 358, 362, 377, 381, 382, 386 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`190333 has 10 divisors and 10 digits in its prime factorization. What is the next term in this sequence with more divisors and digits?`
	EXAMPLE	`143 is a term because it takes 4 digits to write its prime factorization` `143=11*13 and has 4 divisors [1, 11, 13, 143].`
	CROSSREFS	`Cf. A076649.` `Sequence in context: A120533 A095862 A125845 this_sequence A135779 A135778 A078875` `Adjacent sequences: A108868 A108869 A108870 this_sequence A108872 A108873 A108874`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Jul 13 2005`

page 1

Search completed in 0.002 seconds

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.

AT&T Labs Research