Search: id:A006821 Results 1-1 of 1 results found. %I A006821 M3168 %S A006821 1,3,60,7848,3459383,2585136675,2807105250897 %N A006821 Number of connected regular graphs of degree 5 (or quintic graphs) with 2n nodes. %D A006821 CRC Handbook of Combinatorial Designs, 1996, p. 648. %D A006821 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. %D A006821 R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998. %D A006821 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %D A006821 M. Meringer, Fast Generation of Regular Graphs and Construction of Cages. Journal of Graph Theory, 30 (1999), 137-146. [From Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Nov 24 2009] %H A006821 M. Meringer, Tables of Regular Graphs %H A006821 Eric Weisstein's World of Mathematics, Quintic Graph %H A006821 Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics. %Y A006821 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 A006821 Sequence in context: A081854 A085990 A036770 this_sequence A165626 A120307 A022915 %Y A006821 Adjacent sequences: A006818 A006819 A006820 this_sequence A006822 A006823 A006824 %K A006821 nonn,nice,hard,more,new %O A006821 3,2 %A A006821 N. J. A. Sloane (njas(AT)research.att.com). %E A006821 By running M. Meringer's GENREG for about 2 processor years on ARCSgrid at UNcle, a(9) was found by Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Nov 24 2009 Search completed in 0.001 seconds