Enumerating split-pair arrangements (Q2474497)

An arrangement of the \(2n\) numbers \(1,1,2,2,\ldots,n,n\) is called split-pair if for each \(i<n\), exactly one \(i+1\) occurs between the two occurrences of \(i\). The authors prove that the number of such arrangements is equal to \[ (-1)^{n+1}2^n(2^{2n}-1)B_{2n} \] where \(B_i\) denotes the \(i\)th Bernoulli number.