|
%I #11 Sep 20 2018 17:43:11
%S 1,1,0,1,1,1,1,1,2,2,2,2,3,3,3,4,7,5,7,6,11,8,14,9,21,23,24,25,34,39,
%T 40,53,53,80,62,106,138,145,150,184,232,247,307,310,452,398,593,485,
%U 864,969,1068,1093,1465,1613,1855,2145,2438,3074,3014
%N Number of ways to partition n elements into pie slices of different odd sizes allowing the pie to be turned over.
%H Andrew Howroyd, <a href="/A032229/b032229.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, 0, 1, 0... (odds).
%o (PARI) seq(n)={Vec(1 + sum(k=1, sqrtint(n), my(r=k^2); if(k>2, (k-1)!, 2) * x^r / prod(j=1, k, 1 - x^(2*j) + O(x*x^(n-r))))/2)} \\ _Andrew Howroyd_, Sep 20 2018
%K nonn
%O 0,9
%A _Christian G. Bower_
%E a(0)=1 prepended by _Andrew Howroyd_, Sep 20 2018
|
