id:A032189 - OEIS Search Results

Search: id:A032189

Displaying 1-1 of 1 results found.

page 1

Number of ways to partition n elements into pie slices each with an odd number of elements.

+0
1

1, 1, 2, 2, 3, 4, 5, 7, 10, 14, 19, 30, 41, 63, 94, 142, 211, 328, 493, 765, 1170, 1810, 2787, 4340, 6713, 10461, 16274, 25414, 39651, 62074, 97109, 152287, 238838, 375166, 589527, 927554, 1459961, 2300347, 3626242, 5721044 (list; graph; listen)

	OFFSET	`1,3`
	LINKS	`C. G. Bower, Transforms (2)` `Index entries for sequences related to necklaces`
	FORMULA	`"CIK" (necklace, indistinct, unlabeled) transform of 1, 0, 1, 0...(odds)`
	CROSSREFS	`a(n) = A000358(n)-(1+(-1)^n)/2.` `Sequence in context: A133498 A097600 A018128 this_sequence A034395 A032232 A021993` `Adjacent sequences: A032186 A032187 A032188 this_sequence A032190 A032191 A032192`
	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