id:A032154 - OEIS Search Results

Search: id:A032154

Displaying 1-1 of 1 results found.

page 1

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

+0
1

1, 0, 1, 1, 1, 1, 1, 2, 3, 2, 3, 3, 5, 3, 7, 10, 9, 10, 11, 17, 15, 23, 17, 36, 45, 42, 49, 61, 77, 73, 105, 98, 159, 116, 211, 267, 289, 291, 367, 454, 493, 604, 619, 893, 795, 1175, 969, 1716, 1937, 2124, 2185, 2917, 3225, 3697, 4289, 4862, 6147 (list; graph; listen)

	OFFSET	`1,8`
	LINKS	`C. G. Bower, Transforms (2)` `Index entries for sequences related to Lyndon words`
	FORMULA	`"CGK" (necklace, element, unlabeled) transform of 1, 0, 1, 0...(odds)`
	CROSSREFS	`Adjacent sequences: A032151 A032152 A032153 this_sequence A032155 A032156 A032157` `Sequence in context: A031248 A030582 A036762 this_sequence A003051 A097352 A076050`
	KEYWORD	`nonn`
	AUTHOR	`Christian G. Bower (bowerc(AT)usa.net)`

page 1

Search completed in 0.002 seconds

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research