|
%I #17 Mar 28 2019 11:35:03
%S 1,1,1,4,5,16,142,274,989,4288,85946,198694,956474,4175406,27422046,
%T 987716734,2795429469,15572226016,79325378242,505995253870,
%U 4052677330190,262080271991458,855619281477786,5627859038743330
%N Number of ways to partition n labeled elements into pie slices of different sizes.
%H Andrew Howroyd, <a href="/A032144/b032144.txt">Table of n, a(n) for n = 0..200</a>
%H C. G. Bower, <a href="/transforms2.html">Transforms (2)</a>
%H A. Engstrom, <a href="https://doi.org/10.1080/10586458.2009.10128886">Discrete Morse functions from Fourier transforms</a>, Exp. Math. 18 (1) (2009) 45-54
%H <a href="/index/Lu#Lyndon">Index entries for sequences related to Lyndon words</a>
%F "CGJ" (necklace, element, labeled) transform of 1, 1, 1, 1...
%o (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
%K nonn
%O 0,4
%A _Christian G. Bower_
%E a(0)=1 prepended by _Andrew Howroyd_, Sep 11 2018
|
