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

1, 1, 1, 4, 5, 16, 142, 274, 989, 4288, 85946, 198694, 956474, 4175406, 27422046, 987716734, 2795429469, 15572226016, 79325378242, 505995253870, 4052677330190, 262080271991458, 855619281477786, 5627859038743330

Offset

0,4

Links

Andrew Howroyd, Table of n, a(n) for n = 0..200

C. G. Bower, Transforms (2)

A. Engstrom, Discrete Morse functions from Fourier transforms, Exp. Math. 18 (1) (2009) 45-54

Index entries for sequences related to Lyndon words

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: A007837 A032219 A372802 * A032049 A258063 A344061

Adjacent sequences: A032141 A032142 A032143 * A032145 A032146 A032147

Keyword

nonn

Author

Christian G. Bower

Extensions

a(0)=1 prepended by Andrew Howroyd, Sep 11 2018

Status

approved