Is there a known formula for the number of closed walks of length (exactly) $r$ on the $n$-cube?  If not, what are the best known upper and lower bounds?

[Edit] Note: the walk can repeat vertices.