|
%I #13 Sep 13 2018 02:59:35
%S 1,0,1,1,4,11,41,162,925,5945,47017,402788,3895937,40556595,461544253,
%T 5625446270,73716523405,1028179882589,15257484239777,239529471989352,
%U 3971376169852777,69288230115817655,1269563315949912469,24366794306903776610,488969030312192567573
%N Number of ways to partition n labeled elements into pie slices of at least 2 elements allowing the pie to be turned over.
%H Andrew Howroyd, <a href="/A032265/b032265.txt">Table of n, a(n) for n = 0..200</a>
%H C. G. Bower, <a href="/transforms2.html">Transforms (2)</a>
%F "DIJ" (bracelet, indistinct, labeled) transform of 0, 1, 1, 1, ...
%F E.g.f.: 1 + (g(x) + g(x)^2/2 - log(1-g(x)))/2 where g(x) = exp(x) - x - 1. - _Andrew Howroyd_, Sep 12 2018
%o (PARI) seq(n)={my(p=exp(x + O(x*x^n))-x-1); Vec(1 + serlaplace(p + p^2/2 - log(1-p))/2)} \\ _Andrew Howroyd_, Sep 12 2018
%K nonn
%O 0,5
%A _Christian G. Bower_
%E a(0)=1 prepended and terms a(22) and beyond from _Andrew Howroyd_, Sep 12 2018
|
