OFFSET
0,14
COMMENTS
Isomorphism is up to permutation of the elements of the n-set. Each endofunction can be considered to be a loopless digraph where each node has out-degree 1.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 0..1325 (first 51 antidiagonals).
EXAMPLE
Array begins:
==============================================================
n/k| 0 1 2 3 4 5 ...
---+----------------------------------------------------------
0 | 1 1 1 1 1 1 ...
1 | 1 0 0 0 0 0 ...
2 | 1 1 1 1 1 1 ...
3 | 1 2 9 22 63 136 ...
4 | 1 6 162 3935 81015 1369101 ...
5 | 1 13 4527 1497568 384069023 78954264778 ...
6 | 1 40 172335 883538845 3450709120355 10786100835304758 ...
...
PROG
(PARI)
permcount(v) = {my(m=1, s=0, k=0, t); for(i=1, #v, t=v[i]; k=if(i>1&&t==v[i-1], k+1, 1); m*=t*k; s+=t); s!/m}
K(v, m) = {prod(i=1, #v, my(g=gcd(v[i], m), e=v[i]/g); (sum(j=1, #v, my(t=v[j]); if(e%(t/gcd(t, m))==0, t)) - 1)^g)}
T(n, k) = {if(n==0, 1, my(s=0); forpart(q=n, s+=permcount(q) * polcoef(exp(sum(m=1, k, K(q, m)*x^m/m, O(x*x^k))), k)); s/n!)}
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Andrew Howroyd, May 10 2023
STATUS
approved