can anybody extend this new sequence?

[Max]

Jeremy Gardiner wrote:

> %I A000001
> %S A000001 0,7,640,170555,
> %N A000001 a(n) = number of labeled 3-regular (trivalent) multi-graphs
> without loops on 2n vertices with a maximum of 2 edges between any pair of
> nodes.

2 edges between a pair of nodes form a loop, don't they?
Do you mean that there are no longer loops?

Max