id:A050361 - OEIS Search Results

Search: id:A050361

Displaying 1-1 of 1 results found.

page 1

Number of factorizations into distinct prime powers greater than 1.

+0
3

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 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 is a prime power >1}(1+1/n^s).`
	CROSSREFS	`Cf. A000961, A050360-A050364. a(p^k)=A000009. a(A002110)=1.` `Sequence in context: A136713 A043281 A061704 this_sequence A072911 A053150 A163379` `Adjacent sequences: A050358 A050359 A050360 this_sequence A050362 A050363 A050364`
	KEYWORD	`nonn,mult`
	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