%I A014384
%S A014384 1,13,8037796
%N A014384 Number of connected regular graphs of degree 11 with 2n nodes.
%C A014384 Since the 11-regular graph with the least number of vertices is K_12, 
               there are no disconnected 11-regular graphs with less than 24 vertices. 
               Thus for n<24 this sequence also counts the number of all 11-regular 
               graphs on 2n vertices. [From Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), 
               Sep 25 2009]
%D A014384 CRC Handbook of Combinatorial Designs, 1996, p. 648.
%D A014384 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 A014384 M. Meringer, <a href="http://www.mathe2.uni-bayreuth.de/markus/reggraphs.html">
               Tables of Regular Graphs</a>
%H A014384 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 A014384 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 A014384 Sequence in context: A055313 A128669 A013866 this_sequence A034248 A158750 
               A145744
%Y A014384 Adjacent sequences: A014381 A014382 A014383 this_sequence A014385 A014386 
               A014387
%K A014384 nonn,bref,hard,more
%O A014384 6,2
%A A014384 N. J. A. Sloane (njas(AT)research.att.com).