%I A014377
%S A014377 1,5,1547,21609301,733351105934
%N A014377 Number of connected regular graphs of degree 7 with 2n nodes.
%D A014377 CRC Handbook of Combinatorial Designs, 1996, p. 648.
%D A014377 I. A. Faradzev, Constructive enumeration of combinatorial objects, pp. 
               131-135 of Probl\`{e}mes combinatoires et th\'{e}orie des graphes 
               (Orsay, 9-13 Juillet 1976). Colloq. Internat. du C.N.R.S., No. 260, 
               Centre Nat. Recherche Scient., Paris, 1978.
%H A014377 M. Meringer, <a href="http://www.mathe2.uni-bayreuth.de/markus/reggraphs.html">
               Tables of Regular Graphs</a>
%H A014377 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               RegularGraph.html">Link to a section of The World of Mathematics.</
               a>
%Y A014377 Connected regular graphs of degree k: A002851 (k=3), A006820 (k=4), A006821 
               (k=5), A006822 (k=6), A014377 (k=7), A014378 (k=8), A014381 (k=9), 
               A014382 (k=10), A014384 (k=11).
%Y A014377 Sequence in context: A062598 A169620 A145694 this_sequence A165628 A119747 
               A127106
%Y A014377 Adjacent sequences: A014374 A014375 A014376 this_sequence A014378 A014379 
               A014380
%K A014377 nonn,nice,hard,more
%O A014377 4,2
%A A014377 N. J. A. Sloane (njas(AT)research.att.com).
%E A014377 Added another term from <a href="http://www.mathe2.uni-bayreuth.de/markus/
               reggraphs.html">Meringer's page</a> Dmitry Kamenetsky (dkamen(AT)rsise.anu.edu.au), 
               Jul 28 2009
%E A014377 Term a(16) was computed by running Meringer's GENREG for 325 processor 
               days on ARCSgrid at UNcle. Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), 
               Oct 02 2009