OFFSET
0,3
COMMENTS
Number of functions f from a set of size n to itself such that f(f(f(x))) = f(x). - Joel B. Lewis, Dec 12 2011
REFERENCES
I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, Wiley, N.Y., 1983.
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..200
Vladimir Kruchinin, Composition of ordinary generating functions, arXiv:1009.2565 [math.CO], 2010.
FORMULA
E.g.f.: exp(Sum_{d|m} T_k^d/d), where T_k = x*exp(T_(k - 1)), k >= 1, T_0 = x; k = 1, m = 2.
a(n) = sum(sum(k^(n-k)/(n-k)!*binomial(m,k-m)*(1/2)^(k-m),k,m,n)/m!,m,1,n), n>0. - Vladimir Kruchinin, Aug 20 2010
MATHEMATICA
nn=20; a=x Exp[x]; Range[0, nn]!CoefficientList[Series[Exp[a+a^2/2], {x, 0, nn}], x] (* Geoffrey Critzer, Sep 18 2012 *)
PROG
(Maxima) a(n):=sum(sum(k^(n-k)/(n-k)!*binomial(m, k-m)*(1/2)^(k-m), k, m, n)/m!, m, 1, n); /* Vladimir Kruchinin, Aug 20 2010 */
CROSSREFS
KEYWORD
nonn
AUTHOR
Vladeta Jovovic, Apr 07 2001
STATUS
approved