%I #14 Jan 11 2020 15:57:47
%S 0,1,0,3,31,595,33931,6020479,3613415171
%N Number of connected non-regular multigraphs with n nodes of degree up to n.
%C Multigraphs are loopless.
%C Terms computed using nauty traces.
%H Brendan McKay and Adolfo Piperno, <a href="http://pallini.di.uniroma1.it">Nauty traces</a>
%F a(n) = A289988(n) - A319897(n).
%Y Cf. A289988, A289986, A319897.
%K nonn,more,hard
%O 0,4
%A _Natan Arie Consigli_, Sep 30 2018