This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A327604 #15 Jun 02 2025 17:23:56
%S A327604 0,1,832,252207,35241608,2351580473,89216898630,2194653376016,
%T A327604 38376657658125,509484171323720,5390386822995890,47150458233195944,
%U A327604 350827631527584993,2271025998493100911,13023793690772493636
%N A327604 Number of connected 2n-regular loopless multigraphs on nine unlabeled nodes.
%C A327604 There are no (2n+1)-regular graphs satisfying the condition above.
%C A327604 Multigraphs are loopless.
%C A327604 Initial terms computed with 'Nauty and Traces' (see the link).
%H A327604 Brendan McKay and Adolfo Piperno, <a href="http://pallini.di.uniroma1.it">Nauty and Traces</a>
%o A327604 (nauty) for ((n=0;n<12;n=n+2)); do geng -c -d1 9 -q | multig -r${n} -u; done
%Y A327604 Row n=9 of A328682.
%Y A327604 Cf. A324217, A324218.
%K A327604 nonn,more,hard
%O A327604 0,3
%A A327604 _Natan Arie Consigli_, Sep 18 2019
%E A327604 a(6)-a(14) from _Andrew Howroyd_, Mar 18 2020