id:A122811 - OEIS Search Results

Search: id:A122811

Displaying 1-1 of 1 results found.

page 1

Number of prime factors (counted with multiplicity) of the smallest odd number with exactly n divisors.

+0
4

0, 1, 2, 2, 4, 3, 6, 3, 4, 5, 10, 4, 12, 7, 6, 5, 16, 5, 18, 6, 8, 11, 22, 5, 8, 13, 6, 8, 28, 7, 30, 6, 12, 17, 10, 6, 36, 19, 14, 7, 40, 9, 42, 12, 8, 23, 46, 6, 12, 9, 18, 14, 52, 7, 14, 9, 20, 29, 58, 8, 60, 31, 10, 7, 16, 13, 66, 18, 24, 11, 70, 7, 72, 37, 10, 20, 16, 15, 78, 8, 8, 41 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`a(p) = p-1 for prime p.`
	FORMULA	`a(n) = Omega(A038457(n)), where Omega(n) = A001222(n).`
	CROSSREFS	`Cf. A001222, A038457, A122376.` `Sequence in context: A156864 A059975 A087656 this_sequence A089173 A126090 A058266` `Adjacent sequences: A122808 A122809 A122810 this_sequence A122812 A122813 A122814`
	KEYWORD	`nonn`
	AUTHOR	`Ray Chandler (rayjchandler(AT)sbcglobal.net), Sep 22 2006`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research