login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A239770 Number of pairs of functions f, g from a size n set into itself satisfying f(g(f(x))) = g(f(f(x)). 0
1, 1, 10, 213, 7720, 420865, 31879296, 3175850965 (list; graph; refs; listen; history; text; internal format)
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) local l; l:= s(n$2);

       add(add(`if`([seq(evalb(f[g[f[i]]]=g[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

Cf. A181162, A239769, A239773.

Sequence in context: A201621 A057408 A280903 * A239771 A245987 A332408

Adjacent sequences:  A239767 A239768 A239769 * A239771 A239772 A239773

KEYWORD

nonn,more

AUTHOR

Chad Brewbaker, Mar 26 2014

EXTENSIONS

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

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 10 22:36 EDT 2022. Contains 356046 sequences. (Running on oeis4.)