OFFSET
0,3
COMMENTS
The problem is to cut a disk with n chords, no three of which may meet at a single strictly-interior point. For each such slicing, construct the graph on vertices (pieces of the pizza) connected by edges (line segments separating two pieces). a(n) gives the number of such graphs up to isomorphism.
This is an empirical result, obtained from guided random trials. Independent programs agree up to and including a(5)=130. Term a(6)=1814 is unconfirmed.
A054499, counting chord diagrams, is a loose lower bound.
LINKS
Jon Hart, 2 configurations for n=2 cuts
Jon Hart, 5 configurations for n=3 cuts
Jon Hart, 19 configurations for n=4 cuts
Jon Hart, 130 configurations for n=5 cuts
EXAMPLE
For n=3, there are a(3)=5 topologically distinct slicings from chords in general position. These exclude a sixth configuration found when the three chords meet at a point strictly internal to the pizza.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Jon Hart, May 09 2016
STATUS
approved