Number of pairings {(b(1), c(1)), (b(2), c(2)), ..., (b(n), c(n))} of the first 2n positive integers satisfying b(i) < c(i) and such that the 2n numbers c(i)+b(i) and c(i)-b(i) are all distinct.

A002968

Number of pairings {(b(1), c(1)), (b(2), c(2)), ..., (b(n), c(n))} of the first 2n positive integers satisfying b(i) < c(i) and such that the 2n numbers c(i)+b(i) and c(i)-b(i) are all distinct.

Terms

    a(0) =1a(1) =1a(2) =0a(3) =1a(4) =8a(5) =22a(6) =51a(7) =342a(8) =2609a(9) =16896a(10) =99114a(11) =876579a(12) =8551800a(13) =79595269a(14) =764804085a(15) =8905825760a(16) =112166089619

External references