id:A023023 - OEIS Search Results

Search: id:A023023

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n into 3 unordered relatively prime parts.

+0
3

1, 1, 2, 2, 4, 4, 6, 6, 10, 8, 14, 12, 16, 16, 24, 18, 30, 24, 32, 30, 44, 32, 50, 42, 54, 48, 70, 48, 80, 64, 80, 72, 96, 72, 114, 90, 112, 96, 140, 96, 154, 120, 144, 132, 184, 128, 196, 150, 192, 168, 234, 162, 240, 192, 240, 210, 290, 192, 310, 240, 288, 256, 336, 240, 374 (list; graph; listen)

	OFFSET	`3,3`
	FORMULA	`G.f. for the number of partitions of n into m unordered relatively prime parts is Sum(moebius(k)x^(mk)/Product(1-x^(i*k), i=1..m), k=1..infinity). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Dec 21 2004`
	CROSSREFS	`Cf. A023022-A023030, A000741-A000743, A023031-A023035, A101271.` `Adjacent sequences: A023020 A023021 A023022 this_sequence A023024 A023025 A023026` `Sequence in context: A001362 A001310 A029009 this_sequence A008643 A008644 A008645`
	KEYWORD	`nonn`
	AUTHOR	`David W. Wilson (davidwwilson(AT)comcast.net)`

page 1

Search completed in 0.005 seconds

Last modified October 12 15:26 EDT 2008. Contains 144830 sequences.

AT&T Labs Research