id:A050332 - OEIS Search Results

Search: id:A050332

Displaying 1-1 of 1 results found.

page 1

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

+0
2

1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 0, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 0, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 3, 1, 1, 1, 2, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 2, 1, 2, 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 in A026424}(1+1/n^s).`
	CROSSREFS	`Cf. A026424, A045778, A050333. a(p^k)=A000700. a(A002110)=A003724.` `Sequence in context: A025905 A115861 A005087 this_sequence A029425 A025902 A053692` `Adjacent sequences: A050329 A050330 A050331 this_sequence A050333 A050334 A050335`
	KEYWORD	`nonn`
	AUTHOR	`Christian G. Bower (bowerc(AT)usa.net), Oct 15 1999.`

page 1

Search completed in 0.002 seconds

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.

AT&T Labs Research