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

1, 1, 12, 255, 8968, 452485, 31456656, 2899786855, 343386848064

Offset

0,3

Links

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

Lucas A. Brown, C program.

Lucas A. Brown, Python program.

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[f[f[i]]]=f[g[g[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

Crossrefs

Cf. A181162, A239769, A239773.

Sequence in context: A129585 A034672 A133285 * A113091 A053324 A297717

Adjacent sequences: A239775 A239776 A239777 * A239779 A239780 A239781

Keyword

nonn,more,hard

Author

Chad Brewbaker, Mar 26 2014

Extensions

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

a(8) from Lucas A. Brown, Oct 23 2024

Status

approved