7,3

CRC Handbook of Combinatorial Designs, 1996, p. 648.

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.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

M. Meringer, Tables of Regular Graphs

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

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).

Sequence in context: A041667 A132684 A032074 this_sequence A165627 A126458 A048164

Adjacent sequences: A006819 A006820 A006821 this_sequence A006823 A006824 A006825

nonn,nice,hard,more,new

N. J. A. Sloane (njas(AT)research.att.com).

Appended a(16) from running M. Meringer's GENREG for 41 processor days. Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Sep 04 2009

By running M. Meringer's GENREG for 3.5 processor years on ARCSgrid at UNcle, a(17) was found by Jason Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Nov 13 2009