%I #20 Mar 18 2020 03:01:25
%S 0,1,50,933,12465,119906,864705,4930446,23280925,94308983,336704397,
%T 1081565510,3176476119,8638660038,21978039571,52745266132,
%U 120228555981,261785061087,547126506745,1102086250237,2147107495684
%N Number of connected 2n-regular loopless multigraphs on seven unlabeled nodes.
%C There are no (2n+1)-regular graphs satisfying the condition above.
%C Multigraphs are loopless.
%C Initial terms computed with 'nauty and Traces' (see the link).
%H Brendan McKay and Adolfo Piperno, <a href="http://pallini.di.uniroma1.it">nauty and Traces</a>
%o (nauty/shell) for ((n=0;n<30;n=n+2)); do geng -c -d1 7 -q | multig -r${n} -u; done
%Y Row n=7 of A328682.
%Y Cf. A324218.
%K nonn,more,hard
%O 0,3
%A _Natan Arie Consigli_, Apr 30 2019
%E a(10)-a(20) from _Andrew Howroyd_, Mar 17 2020