OFFSET
0,15
LINKS
Jason Kimberley, Connected regular graphs with girth at least 6
Jason Kimberley, Index of sequences counting connected k-regular simple graphs with girth at least g
M. Meringer, Tables of Regular Graphs
M. Meringer, Fast generation of regular graphs and construction of cages, J. Graph Theory 30 (2) (1999) 137-146.
FORMULA
a(n) = sum of the n-th row of A186716.
EXAMPLE
a(37) = 0 + 0 + 1 + 0 + 13504 = 13505.
CROSSREFS
Connected regular graphs of any degree with girth at least g: A005177 (g=3), A186724 (g=4), A186725 (g=5), this sequence (g=6), A186727 (g=7), A186728 (g=8), A186729 (g=9).
KEYWORD
nonn,more,hard
AUTHOR
Jason Kimberley, Nov 23 2011
EXTENSIONS
a(36)-a(37) from Jinyuan Wang, Mar 02 2020
STATUS
approved