This problem is sometimes also called cake cutting or pie cutting, and has the same solution as space division by planes. For
, 2, ... cuts, the maximum number of
pieces is 2, 4, 8, 15, 26, 42, ... (OEIS A000125).
Unsurprisingly, the numbers of this sequence are called cake
numbers.