cp's OEIS Frontend

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.

A008324 Number of simple regular bipartite graphs with 2n nodes.

This page as a plain text file.
%I A008324 #21 Apr 04 2020 11:04:11
%S A008324 1,2,3,4,6,8,18,40,230,4296,431206,162267272,201636689771,
%T A008324 777816803942186,9865957936943931964,395886667549681689591841,
%U A008324 53716176608076643470621234239,23524515269630339982914646821899537,35682168849414944013547274452501768506834
%N A008324 Number of simple regular bipartite graphs with 2n nodes.
%C A008324 First differs from A333732 at n = 12. - _Andrew Howroyd_, Apr 03 2020
%H A008324 Brendan McKay and E. Rogoyski, <a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v2i1n3">Latin squares of order ten</a>, Electron. J. Combinatorics, 2 (1995) #N3.
%Y A008324 Row sums of A008327.
%Y A008324 Cf. A033995, A008323, A333732.
%K A008324 nonn,hard,nice
%O A008324 0,2
%A A008324 _Brendan McKay_
%E A008324 a(0)=1 prepended and terms a(11) and beyond from _Andrew Howroyd_, Apr 03 2020