Template:Central polygonal numbers.svg

The maximum number of pieces, p obtainable with n straight cuts is the n-th triangular number plus one, forming the lazy caterer's sequence (OEIS A000124)