id:A045778 - OEIS Search Results

Search: id:A045778

Displaying 1-1 of 1 results found.

page 1

Number of factorizations of n into distinct factors.

+0
19

1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 3, 2, 2, 1, 5, 1, 2, 2, 3, 1, 5, 1, 3, 2, 2, 2, 5, 1, 2, 2, 5, 1, 5, 1, 3, 3, 2, 1, 7, 1, 3, 2, 3, 1, 5, 2, 5, 2, 2, 1, 9, 1, 2, 3, 4, 2, 5, 1, 3, 2, 5, 1, 9, 1, 2, 3, 3, 2, 5, 1, 7, 2, 2, 1, 9, 2, 2, 2, 5, 1, 9, 2, 3, 2, 2, 2, 10, 1, 3, 3, 5, 1, 5, 1, 5 (list; graph; listen)

	OFFSET	`1,6`
	LINKS	`David W. Wilson, Table of n, a(n) for n = 1..10000` `Eric Weisstein's World of Mathematics, Unordered Factorization`
	FORMULA	`Dirichlet g.f.: prod{n = 2 to inf}(1+1/n^s).`
	CROSSREFS	`Cf. A001055, A045779, A045780, A050323. a(p^k)=A000009. a(A002110)=A000110.` `Sequence in context: A140774 A070040 A056924 this_sequence A033103 A060775 A055399` `Adjacent sequences: A045775 A045776 A045777 this_sequence A045779 A045780 A045781`
	KEYWORD	`nonn,easy,nice`
	AUTHOR	`David W. Wilson (davidwwilson(AT)comcast.net)`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research