I couldn't find a closed-form formula for odd-even network node partner calculation. The only available implementations were recursive and not very elegant. Here is the code that was provided on Wikipedia.
So I decided to work out a simpler and more intuitive solution to odd-even merge-based sorting network partner calculation, and here it is:
Here is the best performance analysis of this network that I could find.