A160860
The least possible number of pieces resulting from cutting a convex n-gon along all its diagonals.
offset: 3
codomain: ℕ
The OEIS sequence has the tags “hard” and/or “more” and few known values. It is likely that the Lean code is not representing the actual sequence, even though it coincides in the known values.
Declarations
Section titled “Declarations”- A160860computable