A326340
Number of maximal simple graphs with vertices {1..n} and no crossing or nesting edges.
offset: 0
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”- A326340computable