login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A239774
Number of pairs of functions f, g from a size n set into itself satisfying f(f(g(x))) = f(f(f(x))).
0
1, 1, 10, 285, 14176, 1034145, 105764256, 14367333421
OFFSET
0,3
MAPLE
s:= proc(n, i) option remember; `if`(i=0, [[]],
map(x-> seq([j, x[]], j=1..n), s(n, i-1)))
end:
a:= proc(n) local l; l:= s(n$2);
add(add(`if`([seq(evalb(f[f[g[i]]]=f[f[f[i]]]),
i=1..n)]=[true$n], 1, 0), g=l), f=l)
end:
seq(a(n), n=0..5); # Alois P. Heinz, Jul 16 2014
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Chad Brewbaker, Mar 26 2014
EXTENSIONS
a(6)-a(7) from Giovanni Resta, Mar 28 2014
STATUS
approved