id:A032181 - OEIS Search Results

Search: id:A032181

Displaying 1-1 of 1 results found.

page 1

Number of ways to partition n labeled elements into pie slices each of at least 2 elements.

+0
1

0, 1, 1, 4, 11, 56, 267, 1730, 11643, 93532, 804563, 7789838, 81109107, 923080328, 11250876171, 147433014058, 2056359699659, 30514968348500, 479058943716579, 7942752339181286, 138576460230586755 (list; graph; listen)

	OFFSET	`1,4`
	LINKS	`C. G. Bower, Transforms (2)` `Index entries for sequences related to necklaces`
	FORMULA	`"CIJ" (necklace, indistinct, labeled) transform of 0, 1, 1, 1...`
	CROSSREFS	`Sequence in context: A053882 A027042 A051770 this_sequence A081073 A002831 A114053` `Adjacent sequences: A032178 A032179 A032180 this_sequence A032182 A032183 A032184`
	KEYWORD	`nonn`
	AUTHOR	`Christian G. Bower (bowerc(AT)usa.net)`

page 1

Search completed in 0.002 seconds

Last modified July 8 18:40 EDT 2008. Contains 141013 sequences.

AT&T Labs Research