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.

A008323 Number of simple connected regular bipartite graphs with 2n nodes.

This page as a plain text file.
%I A008323 #22 Apr 03 2020 21:45:02
%S A008323 1,1,1,2,3,5,12,34,218,4278,431165,162267174,201636689352,
%T A008323 777816803938932,9865957936943859185,395886667549681686369527,
%U A008323 53716176608076643470380213991,23524515269630339982914608683548933,35682168849414944013547274439525153167248
%N A008323 Number of simple connected regular bipartite graphs with 2n nodes.
%H A008323 Brendan McKay and E. Rogoyski, <a href="http://www.combinatorics.org/Volume_2/volume2.html#N3">Latin squares of order ten</a>, Electron. J. Combinatorics, 2 (1995) #N3.
%Y A008323 For n > 1, these are the row sums of triangle A008326.
%Y A008323 Cf. A005142, A008324.
%K A008323 nonn,hard,nice
%O A008323 0,4
%A A008323 _Brendan McKay_
%E A008323 a(10) corrected and a(11) added by _Brendan McKay_, Sep 06 2018
%E A008323 a(0)=1 prepended and terms a(12) and beyond from _Andrew Howroyd_, Apr 03 2020