login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of ways of arranging 2n tokens in a row, with 2 copies of each token from 1 through n, such that the first token is a 1 and between every pair of tokens labeled i (i=1..n) there is exactly one taken labeled (i+1 mod n).
3

%I #2 Feb 27 2009 03:00:00

%S 1,1,2,18,248,5560,174752

%N Number of ways of arranging 2n tokens in a row, with 2 copies of each token from 1 through n, such that the first token is a 1 and between every pair of tokens labeled i (i=1..n) there is exactly one taken labeled (i+1 mod n).

%Y Cf. A002105, A117513, A117515.

%K nonn

%O 1,3

%A Nan Zang (nzang(AT)cs.ucsd.edu), Apr 28 2006