id:A032153 - OEIS Search Results

Search: id:A032153

Displaying 1-1 of 1 results found.

page 1

Number of ways to partition n elements into pie slices of different sizes.

+0
1

1, 1, 2, 2, 3, 5, 6, 8, 11, 19, 22, 32, 41, 57, 92, 114, 155, 209, 280, 364, 587, 707, 984, 1280, 1737, 2213, 2990, 4390, 5491, 7361, 9650, 12708, 16451, 21567, 27506, 40100, 49201, 65701, 84128, 111278, 140595, 184661, 232356, 300680 (list; graph; listen)

	OFFSET	`1,3`
	LINKS	`C. G. Bower, Transforms (2)` `Index entries for sequences related to Lyndon words`
	FORMULA	`"CGK" (necklace, element, unlabeled) transform of 1, 1, 1, 1...` `G.f.: Sum(k >= 0; (k-1)! x^((k^2+k)/2) / Prod(1<=j<=k; 1-x^j)) - Vladeta Jovovic (vladeta(AT)eunet.rs), Sep 21 2004`
	CROSSREFS	`Cf. A032020.` `Sequence in context: A076571 A084783 A129838 this_sequence A116465 A117356 A017819` `Adjacent sequences: A032150 A032151 A032152 this_sequence A032154 A032155 A032156`
	KEYWORD	`nonn,nice`
	AUTHOR	`Christian G. Bower (bowerc(AT)usa.net)`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research