id:A050330 - OEIS Search Results

Search: id:A050330

Displaying 1-1 of 1 results found.

page 1

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

+0
2

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; listen)

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

page 1

Search completed in 0.002 seconds

Last modified October 11 09:12 EDT 2008. Contains 144832 sequences.

AT&T Labs Research