A280006
Number of possible connected steric graphs with n nodes of degree less than 5, excluding the ones with all nodes of degree 4 and trees.
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”- A280006computable