OFFSET
0,31
REFERENCES
M. Meringer, Fast Generation of Regular Graphs and Construction of Cages. Journal of Graph Theory, 30 (1999), 137-146.
LINKS
Jason Kimberley, Connected regular graphs with girth at least 8
Jason Kimberley, Index of sequences counting connected k-regular simple graphs with girth at least g
M. Meringer, Tables of Regular Graphs
FORMULA
a(n) = sum of the n-th row of A186718.
CROSSREFS
Connected regular graphs of any degree with girth at least g: A005177 (g=3), A186724 (g=4), A186725 (g=5), A186726 (g=6), A186727 (g=7), this sequence (g=8), A186729 (g=9).
KEYWORD
nonn,hard,more
AUTHOR
Jason Kimberley, Nov 25 2011
STATUS
approved