A239769 Number of pairs of functions (f, g) from a size n set into itself satisfying f(g(f(x))) = g(g(f(x))).

1, 1, 10, 195, 7000, 397445, 32540976, 3612881587

Offset

0,3

Links

Table of n, a(n) for n=0..7.

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) (l-> add(add(`if`([true$n]=[seq(evalb(
       f[g[f[i]]]=g[g[f[i]]]), i=1..n)], 1, 0), g=l), f=l))(s(n$2))
    end:
seq(a(n), n=0..5);  # Alois P. Heinz, Jul 16 2014

Mathematica

a[n_] := a[n] = If[n == 0, 1, Module[{f, g, T}, T = Tuples[Range[n], n]; Table[f = T[[j, #]]&; g = T[[k, #]]&; Table[True, {n}] == Table[f[g[f[i]]] == g[g[f[i]]], {i, n}], {j, n^n}, {k, n^n}] // Flatten // Count[#, True]&]];
Table[Print[n, " ", a[n]]; a[n], {n, 0, 5}] (* Jean-François Alcover, Sep 22 2022 *)

Crossrefs

Cf. A181162, A239773.

Sequence in context: A239766 A294047 A239768 * A152561 A224298 A222499

Adjacent sequences: A239766 A239767 A239768 * A239770 A239771 A239772

Keyword

nonn,more

Author

Chad Brewbaker, Mar 26 2014

Extensions

a(6)-a(7) from Giovanni Resta, Mar 28 2014

Status

approved