A050370 - OEIS

This site is supported by donations to The OEIS Foundation.

A050370

Number of ways to factor n into composite factors.

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

	OFFSET	`1,16`
	COMMENTS	`a(n) depends only on prime signature of n (cf. A025487). So a(24) = a(375) since 24=2^33 and 375=35^3 both have prime signature (3,1).`
	LINKS	`N. J. A. Sloane, Transforms`
	FORMULA	`Dirichlet g.f.: prod{n is composite}(1/(1-1/n^s)).` `Moebius transform of A001055. - Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 17 2004`
	CROSSREFS	`Cf. A001055, A002808, A050371-A050375. a(p^k)=A002865. a(A002110)=A000296.` `Sequence in context: A052344 A147768 A167746 * A050374 A047886 A014944` `Adjacent sequences: A050367 A050368 A050369 * A050371 A050372 A050373`
	KEYWORD	`nonn`
	AUTHOR	`Christian G. Bower (bowerc(AT)usa.net), Nov 15 1999.`

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

Last modified February 16 21:14 EST 2012. Contains 205971 sequences.