A050326 - OEIS

This site is supported by donations to The OEIS Foundation.

A050326

Number of factorizations of n into distinct squarefree numbers > 1.

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

	OFFSET	`1,6`
	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 is squarefree and > 1}(1+1/n^s).`
	CROSSREFS	`Cf. A005117, A045778, A050327. a(p^k)=0 (p>1). a(A002110)=A000110.` `a(n!)=A103775(n).` `Sequence in context: A054008 A125676 A025874 * A056169 A125070 A125071` `Adjacent sequences: A050323 A050324 A050325 * A050327 A050328 A050329`
	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 10:52 EST 2012. Contains 205763 sequences.