login
Number of connected regular loopless multigraphs on n unlabeled nodes with degree up to n.
2

%I #17 Mar 18 2020 18:45:09

%S 1,1,2,1,6,7,195,984,648947,35494648,689162614688,250087643676776,

%T 116889497942206867366

%N Number of connected regular loopless multigraphs on n unlabeled nodes with degree up to n.

%C Initial terms computed using 'Nauty and Traces'.

%H Brendan McKay and Adolfo Piperno, <a href="http://pallini.di.uniroma1.it">Nauty and Traces</a>

%F a(n) = Sum_{k=0..n} A328682(n, k). - _Andrew Howroyd_, Mar 18 2020

%Y Cf. A289986, A325476, A328682.

%K nonn,more

%O 0,3

%A _Natan Arie Consigli_, Nov 28 2018

%E a(1), a(8) corrected and a(10)-a(12) added by _Andrew Howroyd_, Mar 18 2020