A058063 - OEIS

This site is supported by donations to The OEIS Foundation.

A058063

Number of prime factors, counting with multiplicity of sigma(n), the sum of divisors of n.

0, 1, 2, 1, 2, 3, 3, 2, 1, 3, 3, 3, 2, 4, 4, 1, 3, 2, 3, 3, 5, 4, 4, 4, 1, 3, 4, 4, 3, 5, 5, 3, 5, 4, 5, 2, 2, 4, 4, 4, 3, 6, 3, 4, 3, 5, 5, 3, 2, 2, 5, 3, 4, 5, 5, 5, 5, 4, 4, 5, 2, 6, 4, 1, 4, 6, 3, 4, 6, 6, 5, 3, 2, 3, 3, 4, 6, 5, 5, 3, 2, 4, 4, 6, 5, 4, 5, 5, 4, 4, 5, 5, 7, 6, 5, 5, 3, 3, 4, 2, 3, 6, 4, 4, 7 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,3`
	FORMULA	`a(n)=A001222(A000203(n))`
	EXAMPLE	`n=35, sigma(35)=35+5+7+1=48=2.2.2.2.3, so a(35)=5`
	MAPLE	`with(numtheory):a:=proc(n) if n=0 then 0 else bigomega(sigma(n)) fi end: seq(a(n), n=1..105); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 11 2008`
	CROSSREFS	`A001222, A000203.` `Sequence in context: A109449 A129570 A165014 * A143902 A085472 A054242` `Adjacent sequences: A058060 A058061 A058062 * A058064 A058065 A058066`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Nov 23 2000`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 06:08 EST 2012. Contains 205860 sequences.