This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A032144 Number of ways to partition n labeled elements into pie slices of different sizes. 1
 1, 1, 1, 4, 5, 16, 142, 274, 989, 4288, 85946, 198694, 956474, 4175406, 27422046, 987716734, 2795429469, 15572226016, 79325378242, 505995253870, 4052677330190, 262080271991458, 855619281477786, 5627859038743330 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 LINKS Andrew Howroyd, Table of n, a(n) for n = 0..200 C. G. Bower, Transforms (2) FORMULA "CGJ" (necklace, element, labeled) transform of 1, 1, 1, 1... PROG (PARI) seq(n)=[subst(serlaplace(p/y), y, 1) | p <- Vec(y-1+serlaplace(prod(k=1, n, 1 + x^k*y/k! + O(x*x^n))))] \\ Andrew Howroyd, Sep 11 2018 CROSSREFS Sequence in context: A127007 A007837 A032219 * A032049 A258063 A045680 Adjacent sequences:  A032141 A032142 A032143 * A032145 A032146 A032147 KEYWORD nonn AUTHOR EXTENSIONS a(0)=1 prepended by Andrew Howroyd, Sep 11 2018 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 18 01:01 EDT 2018. Contains 316297 sequences. (Running on oeis4.)