|
%I #14 Sep 11 2018 21:22:03
%S 1,1,0,1,4,1,6,1,64,1009,130,2641,1024,26313,2380,791701,34610944,
%T 3279233,147068106,32201809,1838416384,584037049,37820533300,
%U 3098105429,3047796018304,282732773053601,18988926779316
%N Number of ways to partition n labeled elements into pie slices of different odd sizes.
%H Andrew Howroyd, <a href="/A032145/b032145.txt">Table of n, a(n) for n = 0..200</a>
%H C. G. Bower, <a href="/transforms2.html">Transforms (2)</a>
%H <a href="/index/Lu#Lyndon">Index entries for sequences related to Lyndon words</a>
%F "CGJ" (necklace, element, labeled) transform of 1, 0, 1, 0... (odds)
%o (PARI) seq(n)=[subst(serlaplace(p/y),y,1) | p <- Vec(y-1+serlaplace(prod(k=1, ceil(n/2), 1 + x^(2*k-1)*y/(2*k-1)! + O(x*x^n))))] \\ _Andrew Howroyd_, Sep 11 2018
%K nonn
%O 0,5
%A _Christian G. Bower_
%E a(0)=1 prepended by _Andrew Howroyd_, Sep 11 2018
|
