1377984domain: NAppears in sequencesa(n) is the number of inequivalent permutations of {0..2n-1}, such that the first differences (modulo 2n) are a permutation of {1..2n-1}.at n=7A067601