A058227
Number of edges in all simple (loopless) paths, connecting any node with all the remaining ones in optimal graphs of degree 4.
offset: 1
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”- A058227computable