  In this paper, we consider a game played on a rectangular $m \times n$
gridded chocolate bar. Each move, a player breaks the bar along a grid line.
Each move after that consists of taking any piece of chocolate and breaking it
again along existing grid lines, until just $mn$ individual squares remain.
  This paper enumerates the number of ways to break an $m \times n$ bar, which
we call chocolate numbers, and introduces four new sequences related to these
numbers. Using various techniques, we prove interesting divisibility results
regarding these sequences.
