Number of permutations of [1..n] which achieve the worse case bound for a graph domination problem.

A272640

Number of permutations of [1..n] which achieve the worse case bound for a graph domination problem.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =4a(4) =24a(5) =56a(6) =640a(7) =1632a(8) =30464a(9) =81664a(10) =2251008a(11) =6241280a(12) =238222336a(13) =676506624a(14) =34141233152a(15) =98709925888

External references