login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A239765 Number of pairs of functions (f,g) from a set of n elements into itself satisfying f(f(g(x))) = g(g(g(x))). 0

%I

%S 1,1,10,189,6304,315065,21848976,1992930037

%N Number of pairs of functions (f,g) from a set of n elements into itself satisfying f(f(g(x))) = g(g(g(x))).

%Y Cf. A181162.

%K nonn,more

%O 0,3

%A _Chad Brewbaker_, Mar 26 2014

%E a(6)-a(7) from _Giovanni Resta_, Mar 28 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 19 20:41 EST 2020. Contains 331066 sequences. (Running on oeis4.)