Number of types of (n-1)-swap moves for traveling salesman problem. Number of circular permutations on elements 0,1,...,2n-1 where every two elements 2i,2i+1 and no two elements 2i-1,2i are adjacent.
A061714
Number of types of (n-1)-swap moves for traveling salesman problem. Number of circular permutations on elements 0,1,...,2n-1 where every two elements 2i,2i+1 and no two elements 2i-1,2i are adjacent.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =4a(4) =25a(5) =208a(6) =2121a(7) =25828a(8) =365457a(9) =5895104a(10) =106794993a(11) =2147006948a(12) =47436635753
External references
- oeis: A061714