OFFSET
0,4
LINKS
Andrew Howroyd, Table of n, a(n) for n = 0..200
Miklos Bona, Michel Bousquet, Gilbert Labelle, and Pierre Leroux, Enumeration of m-ary cacti, Advances in Applied Mathematics, 24 (2000), 22-56.
FORMULA
a(n) = (1/n)*(Sum_{d|n} mu(n/d)*binomial(3*d, d)) - 2*binomial(3*n, n)/(2*n+1) for n > 0. - Andrew Howroyd, May 02 2018
MATHEMATICA
a[0] = 1; a[n_] := (1/n) Sum[MoebiusMu[n/d] Binomial[3d, d], {d, Divisors[n] } ] - 2 Binomial[3n, n]/(2n + 1);
Table[a[n], {n, 0, 23}] (* Jean-François Alcover, Jul 24 2018, after Andrew Howroyd *)
PROG
(PARI) a(n) = if(n==0, 1, sumdiv(n, d, moebius(n/d)*binomial(3*d, d))/n - 2*binomial(3*n, n)/(2*n+1)) \\ Andrew Howroyd, May 02 2018
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Simon Plouffe, Mar 15 2000
EXTENSIONS
More terms from James A. Sellers, Mar 16 2000
STATUS
approved