This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A032146 Number of ways to partition n labeled elements into pie slices of different sizes other than one. 1
 1, 0, 1, 1, 1, 11, 16, 57, 85, 2767, 5416, 24113, 100574, 273495, 15992432, 41127439, 216169517, 1019382935, 6416113192, 20157869121, 2445135147850, 7427652810379, 47171445392204, 249316471654319 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,6 LINKS Andrew Howroyd, Table of n, a(n) for n = 0..200 C. G. Bower, Transforms (2) FORMULA "CGJ" (necklace, element, labeled) transform of 0, 1, 1, 1... PROG (PARI) seq(n)=[subst(serlaplace(p/y), y, 1) | p <- Vec(y-1+serlaplace(prod(k=2, n, 1 + x^k*y/k! + O(x*x^n))))] \\ Andrew Howroyd, Sep 11 2018 CROSSREFS Sequence in context: A302207 A032311 A032221 * A032051 A085487 A258288 Adjacent sequences:  A032143 A032144 A032145 * A032147 A032148 A032149 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 17 21:42 EDT 2018. Contains 316293 sequences. (Running on oeis4.)