  For various sets of tiles, we count the ways to tile an Aztec diamond of
order $n$ using tiles from that set. The resulting function $f(n)$ often has
interesting behavior when one looks at $n$ and $f(n)$ modulo powers of 2.
