id:A038041 - OEIS Search Results

Search: id:A038041

Displaying 1-1 of 1 results found.

page 1

Number of ways to partition a labeled set into subsets of equal size.

+0
9

1, 2, 2, 5, 2, 27, 2, 142, 282, 1073, 2, 32034, 2, 136853, 1527528, 4661087, 2, 227932993, 2, 3689854456, 36278688162, 13749663293, 2, 14084955889019, 5194672859378, 7905858780927, 2977584150505252, 13422745388226152, 2 (list; graph; listen)

	OFFSET	`1,2`
	FORMULA	`Sum { d divides n } (n!/(d!*((n/d)!)^d)). E.g.f. sum {k >= 1} (exp(x^k/k!)-1).`
	CROSSREFS	`Sequence in context: A068058 A114976 A085483 this_sequence A097891 A097611 A135376` `Adjacent sequences: A038038 A038039 A038040 this_sequence A038042 A038043 A038044`
	KEYWORD	`nonn,easy`
	AUTHOR	`Christian G. Bower (bowerc(AT)usa.net)`
	EXTENSIONS	`More terms from Erich Friedman (erich.friedman(AT)stetson.edu).`

page 1

Search completed in 0.002 seconds

Last modified September 7 23:08 EDT 2008. Contains 143486 sequences.

AT&T Labs Research