login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

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
OFFSET
0,6
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
KEYWORD
nonn
EXTENSIONS
a(0)=1 prepended by Andrew Howroyd, Sep 11 2018
STATUS
approved