Number of edges in all simple (loopless) paths, connecting any node with all the remaining ones in optimal graphs of degree 4.
A058227
Number of edges in all simple (loopless) paths, connecting any node with all the remaining ones in optimal graphs of degree 4.
Terms
- a(0) =4a(1) =28a(2) =112a(3) =352a(4) =972a(5) =2484a(6) =6040a(7) =14200
External references
- oeis: A058227