OFFSET
0,7
COMMENTS
Original name: a simple grammar.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 0..200
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 743
FORMULA
E.g.f.: x^3*log(-1/(-1+x))^3.
Recurrence: {a(1)=0, a(2)=0, a(4)=0, a(3)=0, a(5)=0, a(6)=720, (16*n^4+135*n+162-81*n^2-42*n^3-n^6+3*n^5)*a(n) + (-228+81*n^2+3*n^5+104*n-38*n^3-6*n^4)*a(n+1) + (36+6*n^3-3*n^4+21*n^2-60*n)*a(n+2) + (-3*n^2+n^3+2*n)*a(n+3)}.
a(n) = n*A052765(n-1) = 3!*n*(n-1)*(n-2)*abs(Stirling1(n-3,3)) for n >= 3. - Andrew Howroyd, Aug 08 2020
MAPLE
spec := [S, {B=Cycle(Z), S=Prod(Z, Z, Z, B, B, B)}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);
PROG
(PARI) a(n)={if(n>=3, 3!*n*(n-1)*(n-2)*abs(stirling(n-3, 3, 1)), 0)} \\ Andrew Howroyd, Aug 08 2020
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
INRIA Encyclopedia of Combinatorial Structures, Jan 25 2000
EXTENSIONS
Named changed and terms a(20) and beyond from Andrew Howroyd, Aug 08 2020
STATUS
approved
