Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Table of n, a(n) for n=0..16.
Jason Kimberley, Index of sequences counting not necessarily connected k-regular simple graphs with girth exactly g
a(n) = A185335(n) - A185336(n).
a(n) = A006925(n) + A185035(n).
Not necessarily connected 3-regular simple graphs on 2n vertices with girth exactly g: A185130 (triangle); fixed g: A185133 (g=3), A185134 (g=4), this sequence (g=5), A185136 (g=6).
Sequence in context: A112541 A052667 A006925 * A238805 A005867 A192411
Adjacent sequences: A185132 A185133 A185134 * A185136 A185137 A185138
Jason Kimberley, Mar 21 2012