A061714 - cp's OEIS frontend

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.

n	a(n)
0	1
1	0
2	1
3	4
4	25
5	208
6	2121
7	25828
8	365457
9	5895104
10	106794993
11	2147006948
12	47436635753
13	1142570789072
14	29797622256377
15	836527783016196
16	25153234375160993
17	806519154686509056
18	27470342073410272609

[1, 0, 1, 4, 25, 208, 2121, 25828, 365457, 5895104, 106794993, 2147006948, 47436635753, 1142570789072, 29797622256377, 836527783016196, 25153234375160993, 806519154686509056, 27470342073410272609]

cp's OEIS Frontend

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.

Table of values

List of values