%I A014381
%S A014381 1,9,88193,113314233813
%N A014381 Number of connected regular graphs of degree 9 with 2n nodes.
%C A014381 Since the 9-regular graph with the least number of vertices is K_10, 
               there are no disconnected 9-regular graphs with less than 20 vertices. 
               Thus for n<20 this sequence also gives the number of all 9-regular 
               graphs on 2n vertices. [From Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), 
               Sep 25 2009]
%D A014381 CRC Handbook of Combinatorial Designs, 1996, p. 648.
%D A014381 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 A014381 M. Meringer, <a href="http://www.mathe2.uni-bayreuth.de/markus/reggraphs.html">
               Tables of Regular Graphs</a>
%H A014381 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 A014381 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 A014381 Sequence in context: A013790 A058452 A058456 this_sequence A034995 A109464 
               A120352
%Y A014381 Adjacent sequences: A014378 A014379 A014380 this_sequence A014382 A014383 
               A014384
%K A014381 nonn,bref,more,hard
%O A014381 5,2
%A A014381 N. J. A. Sloane (njas(AT)research.att.com).
%E A014381 a(8) from Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Sep 
               25 2009