id:A050370 - OEIS Search Results

Search: id:A050370

Displaying 1-1 of 1 results found.

page 1

Number of ways to factor n into composite factors.

+0
6

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; listen)

	OFFSET	`1,16`
	COMMENT	`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 this_sequence A050374 A047886 A014944` `Adjacent sequences: A050367 A050368 A050369 this_sequence A050371 A050372 A050373`
	KEYWORD	`nonn`
	AUTHOR	`Christian G. Bower (bowerc(AT)usa.net), Nov 15 1999.`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research