id:A058061 - OEIS Search Results

Search: id:A058061

Displaying 1-1 of 1 results found.

page 1

Number of prime factors (counted with multiplicity) of d(n), the number of divisors of n.

+0
7

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

	OFFSET	`1,6`
	FORMULA	`a(n)=A001222(A000005(n))`
	EXAMPLE	`n=120, d(n)=16, a(n)=4.`
	CROSSREFS	`Cf. A001222, A000005, A058060.` `Sequence in context: A161276 A160980 A065031 this_sequence A064547 A086435 A099305` `Adjacent sequences: A058058 A058059 A058060 this_sequence A058062 A058063 A058064`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Nov 23 2000`

page 1

Search completed in 0.005 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research