|
%I #13 Sep 11 2018 21:26:37
%S 1,1,1,4,5,16,82,169,541,2272,43166,99859,479030,2089751,13714261,
%T 493866559,1397727901,7786145776,39662742502,252997758007,
%U 2026338881050,131040136520017,427809641611111,2813929521468817
%N Number of ways to partition n labeled elements into pie slices of different sizes allowing the pie to be turned over.
%H Andrew Howroyd, <a href="/A032219/b032219.txt">Table of n, a(n) for n = 0..200</a>
%H C. G. Bower, <a href="/transforms2.html">Transforms (2)</a>
%F "DGJ" (bracelet, element, labeled) transform of 1, 1, 1, 1...
%o (PARI) seq(n)=[subst(serlaplace(p/y + polcoeff(p,1) + polcoeff(p,2)),y,1)/2 | 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
|
