Skip to search formSkip to main contentSkip to account menu

Lazy caterer's sequence

Known as: Central polygonal numbers, Circle cutting problem, A000124 
The lazy caterer's sequence, more formally known as the central polygonal numbers, describes the maximum number of pieces of a circle (a pancake or… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Focusing on the unconstrained circle cutting problem, a recursive algorithm which can generate four-block cutting pattern was… 
2017
2017
We split the crossings of the foil knot and enumerate the resulting states with a generating polynomial. Unexpectedly, the number… 
2011
2011
Das Luftfahrt-Catering ist ein stetig, global wachsender Markt mit vielen Unternehmensubergreifenden Prozessen. Um… 
2011
2011
Developing an Employee Training Addendum for a Sustainable Hospitality Operation by Devon A. Williams Robert Woods, Committee… 
2011
2011
Probability is a rich part of applied mathematics. First we have a look at the unique encounter of two 23 year old chess players… 
2007
2007
This paper is concerned with the development of a customized circle packing algorithm for a manufacturer of sprockets for the… 
2007
2007
Circular blanks are often cut from silicon steel plates to make stators and rotors of electric motors. The shearing and punching…