OFFSET
0,3
COMMENTS
Previous name was: A simple grammar.
LINKS
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 838
FORMULA
D-finite with Recurrence: {a(1)=0, a(2)=2, (2*n^2+2*n)*a(n)-3*(n+1)*a(n+1)+a(n+2)}.
a(n) = -2*GAMMA(n+1)+2^(n+1)*GAMMA(n+1).
a(n) = 2*A052589(n-1). - R. J. Mathar, Jun 03 2022
MAPLE
spec := [S, {B=Sequence(Z, 1 <= card), C=Prod(B, B), S= Cycle(C)}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);
MATHEMATICA
Range[0, 19]! CoefficientList[Series[Log[-(-1 + x)^2/(-1 + 2 x)], {x, 0, 19}], x] (* Vincenzo Librandi, Jul 09 2015 *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
STATUS
approved