  We consider the chessboard pebbling problem analyzed by Chung, Graham,
Morrison and Odlyzko [3]. We study the number of reachable configurations
$G(k)$ and a related double sequence $G(k,m)$. Exact expressions for these are
derived, and we then consider various asymptotic limits.
