%I #10 Sep 20 2018 17:43:33
%S 1,0,1,1,1,2,2,3,3,5,5,7,8,10,14,17,21,27,35,41,64,74,100,125,167,207,
%T 267,383,470,616,794,1027,1307,1703,2085,3015,3632,4796,6022,7913,
%U 9817,12809,15935,20157,27408,33776,43112,54937,69863,87637
%N Number of ways to partition n elements into pie slices of different sizes of at least 2 allowing the pie to be turned over.
%H Andrew Howroyd, <a href="/A032230/b032230.txt">Table of n, a(n) for n = 0..1000</a>
%H C. G. Bower, <a href="/transforms2.html">Transforms (2)</a>
%F "DGK" (bracelet, element, unlabeled) transform of 0, 1, 1, 1...
%o (PARI) seq(n)={Vec(1 + sum(k=1, n, my(r=(k^2+3*k)/2); if(r<=n, if(k>2, (k-1)!, 2) * x^r / prod(j=1, k, 1 - x^j + O(x*x^(n-r)))))/2)} \\ _Andrew Howroyd_, Sep 20 2018
%K nonn
%O 0,6
%A _Christian G. Bower_
%E a(0)=1 prepended by _Andrew Howroyd_, Sep 20 2018