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 A129437 #17 Mar 21 2020 20:10:08
%S A129437 1,5,22,181,2183,47773,1689841,90972682,6948008975,721121538707,
%T A129437 98626660242232,17361164959413148,3857920886847174328,
%U A129437 1064590883337392451345,359664321908847682542521,146924560811224485478212220,71778969194383385732028947007,41528817306107485906955040499799
%N A129437 Number of isomorphism classes of 8-regular multigraphs of order n, loops allowed.
%C A129437 Initial terms computed using software at http://users.cecs.anu.edu.au/~bdm/nauty/
%H A129437 R. C. Read, <a href="http://dx.doi.org/10.1112/jlms/s1-34.4.417">The enumeration of locally restricted graphs (I)</a>, J. London Math. Soc. 34 (1959) 417-436. [From _Jason Kimberley_, Nov 09 2009]
%F A129437 a(n)=N\{S_n[S_8] * S_{4n}[S_2]\}. - _Jason Kimberley_, Nov 09 2009
%F A129437 Euler transform of A129436. - _Andrew Howroyd_, Mar 15 2020
%Y A129437 Column k=8 of A167625.
%Y A129437 Cf. A129436, A129426, A129427, A129429, A129431, A129433, A129435.
%K A129437 nonn
%O A129437 1,2
%A A129437 _Brendan McKay_, Apr 15 2007
%E A129437 Using equation (5.8) of Read 1959, McKay's terms verified by, and new term a(11) was computed by _Jason Kimberley_, Nov 09 2009
%E A129437 a(12)=N{S_12[S_8]*S_48[S_2]} was computed in MAGMA, on one processor of ARCSgrid at UNcle, using 17 GB virtual memory, over 49 real days, with 36 days processor time, by _Jason Kimberley_, Nov 29 2009
%E A129437 a(13)-a(18) from _Andrew Howroyd_, Mar 21 2020