id:A122375 - OEIS Search Results

Search: id:A122375

Displaying 1-1 of 1 results found.

page 1

Number of distinct prime factors of the smallest number with exactly n divisors.

+0
6

0, 1, 1, 2, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 2, 3, 1, 3, 1, 3, 2, 2, 1, 3, 2, 2, 3, 3, 1, 3, 1, 4, 2, 2, 2, 4, 1, 2, 2, 4, 1, 3, 1, 3, 3, 2, 1, 4, 2, 3, 2, 3, 1, 4, 2, 4, 2, 2, 1, 4, 1, 2, 3, 4, 2, 3, 1, 3, 2, 3, 1, 4, 1, 2, 3, 3, 2, 3, 1, 4, 4, 2, 1, 4, 2, 2, 2, 4, 1, 4, 2, 3, 2, 2, 2, 5, 1, 3, 3, 4, 1, 3, 1, 4, 3 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`a(n)=1 iff n is prime.`
	FORMULA	`a(n) = omega(A005179(n)), where omega(n) = A001221(n).` `a(n) = A001221(A130279(n)). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 21 2007`
	CROSSREFS	`Cf. A038457.` `Sequence in context: A056171 A076755 A106490 this_sequence A038548 A068108 A113309` `Adjacent sequences: A122372 A122373 A122374 this_sequence A122376 A122377 A122378`
	KEYWORD	`nonn`
	AUTHOR	`Lekraj Beedassy (blekraj(AT)yahoo.com), Aug 30 2006`
	EXTENSIONS	`Edited and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Sep 11 2006`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research