id:A050372 - OEIS Search Results

Search: id:A050372

Displaying 1-1 of 1 results found.

page 1

Number of ways to factor n into distinct composite factors.

+0
2

1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 2, 1, 1, 1, 1, 0, 1, 0, 2, 1, 1, 1, 2, 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, 2, 1, 1, 0, 1, 1, 1, 0, 4, 0, 1, 1, 1, 1, 1, 0, 3, 1, 1, 0, 3, 1, 1, 1, 2, 0, 3, 1, 1, 1, 1, 1, 4, 0, 1, 1, 2, 0, 1 (list; graph; listen)

	OFFSET	`1,24`
	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).`
	FORMULA	`Dirichlet g.f.: prod{n is composite}(1+1/n^s).`
	CROSSREFS	`Cf. A002808, A045778, A050370-A050375. a(p^k)=A025147. a(A002110)=A000296.` `Sequence in context: A037908 A116663 A074871 this_sequence A037802 A037879 A025449` `Adjacent sequences: A050369 A050370 A050371 this_sequence A050373 A050374 A050375`
	KEYWORD	`nonn`
	AUTHOR	`Christian G. Bower (bowerc(AT)usa.net), Nov 15 1999.`

page 1

Search completed in 0.002 seconds

Last modified July 8 18:40 EDT 2008. Contains 141013 sequences.

AT&T Labs Research