A050330 - OEIS

This site is supported by donations to The OEIS Foundation.

A050330

Number of factorizations of n into numbers with an odd number of prime factors.

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

	OFFSET	`1,8`
	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).`
	FORMULA	`Dirichlet g.f.: prod_{n in A026424} (1/(1-1/n^s)).`
	CROSSREFS	`Cf. A001055, A026424, A050331. a(p^k)=A000009. a(A002110)=A003724.` `Sequence in context: A118663 A205119 A102097 * A205788 A076398 A086257` `Adjacent sequences: A050327 A050328 A050329 * A050331 A050332 A050333`
	KEYWORD	`nonn`
	AUTHOR	`Christian G. Bower (bowerc(AT)usa.net), Oct 15 1999.`

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

Last modified February 15 21:56 EST 2012. Contains 205860 sequences.