[seqfan] Cutting a rectangle into two identical parts

[Charles Greathouse]

This programming challenge:*
http://rosettacode.org/wiki/Cut_a_rectangle
asks for the number of ways to cut a path through an m X n rectangle
such that one part, rotated 180 degrees and translated, coincides with
the other. (This is obviously only possible when mn is even.)

Is this sequence in the OEIS?  I couldn't find it.


* Technically not a challenge but a chrestomathy or "Rosetta stone",
hence the name of the site.

Charles Greathouse
Analyst/Programmer
Case Western Reserve University