%I A014378
%S A014378 1,1,6,94,10786,3459386,1470293676,733351105935
%N A014378 Number of connected regular graphs of degree 8 with n nodes.
%C A014378 Since the 8-regular graph with the least number of vertices is K_9, there 
               are no disconnected 8-regular graphs with less than 18 vertices. 
               Thus for n<18 this sequence also counts the number of all 8-regular 
               graphs on n vertices. [From Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), 
               Sep 25 2009]
%D A014378 CRC Handbook of Combinatorial Designs, 1996, p. 648.
%D A014378 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 A014378 M. Meringer, <a href="http://www.mathe2.uni-bayreuth.de/markus/reggraphs.html">
               Tables of Regular Graphs</a>
%H A014378 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 A014378 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 A014378 Sequence in context: A103212 A033935 A078103 this_sequence A058465 A119627 
               A116158
%Y A014378 Adjacent sequences: A014375 A014376 A014377 this_sequence A014379 A014380 
               A014381
%K A014378 nonn,hard,more
%O A014378 9,3
%A A014378 N. J. A. Sloane (njas(AT)research.att.com).
%E A014378 a(15),a(16) from Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), 
               Sep 25 2009