|
%I #11 May 01 2014 02:39:59
%S 1,1,1,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,4,1,22,1,547,1,
%T 30369,1,1782841,1,95079084,1,4686063121,1
%N Number of connected regular graphs with n nodes and girth at least 7.
%D M. Meringer, Fast Generation of Regular Graphs and Construction of Cages. Journal of Graph Theory, 30 (1999), 137-146.
%H Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/C_k-reg_girth_ge_g_index">Index of sequences counting connected k-regular simple graphs with girth at least g</a>
%H Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/C_girth_ge_7">Connected regular graphs with girth at least 7</a>
%H M. Meringer, <a href="http://www.mathe2.uni-bayreuth.de/markus/reggraphs.html">Tables of Regular Graphs</a>
%F a(n) = sum of the n-th row of A186717.
%Y Connected regular graphs of any degree with girth at least g: A005177 (g=3), A186724 (g=4), A186725 (g=5), A186726 (g=6), this sequence (g=7), A186728 (g=8), A186729 (g=9).
%Y Connected k-regular simple graphs with girth at least 7: this sequence (any k), A186717 (triangle); specific k: A185117 (k=2), A014375 (k=3).
%K nonn,more,hard
%O 0,25
%A _Jason Kimberley_, Nov 25 2011
|
