A185153 Number of not necessarily connected 5-regular simple graphs on 2n vertices with girth exactly 3.

0, 0, 0, 1, 3, 59, 7848, 3459379, 2585136353, 2807104852102

Offset: 0

Author

Jason Kimberley, Mar 12 2012

Keywords

• nonn
• hard
• more

Links

• Jason Kimberley, Index of sequences counting not necessarily connected k-regular simple graphs with girth exactly g

Crossrefs

Not necessarily connected k-regular simple graphs girth exactly 3: A198313 (any k), A185643 (triangle); fixed k: A026796 (k=2), A185133 (k=3), A185143 (k=4), this sequence (k=5), A185163 (k=6).

Formula

a(n) = A165626(n) - A185354(n).

a(n) = A184953(n) + A185053(n).