 Lazy caterer's sequence

The Lazy Caterer's sequence is a sequence of numbers that represents the maximum number of pieces of cake (or any flat, two-dimensional object) that can be obtained by making a certain number of straight cuts. The sequence starts with zero cuts and progresses as follows: 1. For zero cuts, there is one piece (the whole cake). 2. For one cut, there are two pieces. 3. For two cuts, if the cuts intersect, there can be four pieces.