|
%I #10 Sep 20 2018 17:42:58
%S 1,1,1,2,2,3,4,5,6,8,12,14,19,24,32,50,61,82,109,145,187,299,359,498,
%T 646,875,1113,1502,2202,2753,3688,4833,6362,8234,10792,13762,20059,
%U 24610,32860,42074,55649,70308,92341,116189,150351,207101
%N Number of ways to partition n elements into pie slices of different sizes allowing the pie to be turned over.
%H Andrew Howroyd, <a href="/A032228/b032228.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 1, 1, 1, 1...
%o (PARI) seq(n)={Vec(1 + sum(k=1, n, my(r=(k*(k+1))/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,4
%A _Christian G. Bower_
%E a(0)=1 prepended by _Andrew Howroyd_, Sep 20 2018
|
