id:A032190 - OEIS Search Results

Search: id:A032190

Displaying 1-1 of 1 results found.

page 1

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

+0
2

0, 1, 1, 2, 2, 4, 4, 7, 9, 14, 18, 30, 40, 63, 93, 142, 210, 328, 492, 765, 1169, 1810, 2786, 4340, 6712, 10461, 16273, 25414, 39650, 62074, 97108, 152287, 238837, 375166, 589526, 927554, 1459960, 2300347, 3626241, 5721044 (list; graph; listen)

	OFFSET	`1,4`
	LINKS	`C. G. Bower, Transforms (2)` `INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 764` `Index entries for sequences related to necklaces`
	FORMULA	`"CIK" (necklace, indistinct, unlabeled) transform of 0, 1, 1, 1...`
	CROSSREFS	`a(n) = A000358(n)-1.` `Sequence in context: A056503 A055636 A034396 this_sequence A005852 A115209 A139210` `Adjacent sequences: A032187 A032188 A032189 this_sequence A032191 A032192 A032193`
	KEYWORD	`nonn`
	AUTHOR	`Christian G. Bower (bowerc(AT)usa.net)`

page 1

Search completed in 0.002 seconds

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.

AT&T Labs Research