|
%I #16 Aug 10 2020 02:00:34
%S 0,1,2,5,16,56,217,876,3686,15903,70103,314042,1426076,6548060,
%T 30352695,141837086,667469159,3160370217,15045244375,71970393570,
%U 345766441537,1667629158127,8071308125136,39190243658297,190845259909328,931856232714004,4561292365652751
%N Number of objects generated by the Combstruct grammar defined in the Maple program. See the link for the grammar specification.
%H Andrew Howroyd, <a href="/A052891/b052891.txt">Table of n, a(n) for n = 0..200</a>
%H INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=867">Encyclopedia of Combinatorial Structures 867</a>
%H Maplesoft, <a href="https://www.maplesoft.com/support/help/Maple/view.aspx?path=examples%2fcombstruct_grammars">Combstruct grammars</a>.
%F G.f.: 1 - 1/g(x) where g(x) is the g.f. of A052893. - _Andrew Howroyd_, Aug 09 2020
%p spec := [S, {C=Prod(Z,B), S=Set(C,1 <= card), B=Sequence(S)}, unlabeled]:
%p seq(combstruct[count](spec,size=n), n=0..20);
%o (PARI) EulerT(v)={Vec(exp(x*Ser(dirmul(v,vector(#v,n,1/n))))-1, -#v)}
%o seq(n)={my(v=[0]); for(n=1, n, v=concat([0],EulerT(Vec(1/(1-Ser(v)))))); v} \\ _Andrew Howroyd_, Aug 09 2020
%Y Cf. A052893.
%K easy,nonn
%O 0,3
%A encyclopedia(AT)pommard.inria.fr, Jan 25 2000
%E Terms a(21) and beyond from _Andrew Howroyd_, Aug 09 2020
|
