A050320 - OEIS

This site is supported by donations to The OEIS Foundation.

A050320

Number of ways n is a product of squarefree numbers > 1.

1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 2, 1, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 1, 2, 1, 5, 1, 1, 2, 2, 2, 3, 1, 2, 2, 2, 1, 5, 1, 2, 2, 2, 1, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 6, 1, 2, 2, 1, 2, 5, 1, 2, 2, 5, 1, 3, 1, 2, 2, 2, 2, 5, 1, 2, 1, 2, 1, 6, 2, 2, 2, 2, 1, 6, 2, 2, 2, 2, 2, 2, 1, 2, 2, 3, 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-1/n^s)).`
	CROSSREFS	`Cf. A001055, A005117, A050325. a(p^k)=1. a(A002110)=A000110.` `a(n!)=A103774(n).` `Sequence in context: A064372 A096825 A007875 * A121382 A051265 A008647` `Adjacent sequences: A050317 A050318 A050319 * A050321 A050322 A050323`
	KEYWORD	`nonn,easy,nice`
	AUTHOR	`Christian G. Bower (bowerc(AT)usa.net), Sep 15 1999.`

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

Last modified February 15 03:59 EST 2012. Contains 205694 sequences.