Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the
OEIS Foundation home page.
A117515
Number of ways of arranging 2n tokens in a row, with 2 copies of each token from 1 through n, such that between every pair of tokens labeled i (i=1..n) there is exactly one taken labeled (i+1 mod n).