|
%I #14 Sep 11 2018 21:22:20
%S 1,0,1,1,1,11,16,57,85,2767,5416,24113,100574,273495,15992432,
%T 41127439,216169517,1019382935,6416113192,20157869121,2445135147850,
%U 7427652810379,47171445392204,249316471654319
%N Number of ways to partition n labeled elements into pie slices of different sizes other than one.
%H Andrew Howroyd, <a href="/A032146/b032146.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 0, 1, 1, 1...
%o (PARI) seq(n)=[subst(serlaplace(p/y),y,1) | p <- Vec(y-1+serlaplace(prod(k=2, n, 1 + x^k*y/k! + O(x*x^n))))] \\ _Andrew Howroyd_, Sep 11 2018
%K nonn
%O 0,6
%A _Christian G. Bower_
%E a(0)=1 prepended by _Andrew Howroyd_, Sep 11 2018
|
