A186748 Number of connected regular simple graphs on n vertices with girth exactly 8.

0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 3, 0, 13, 0, 155, 0, 4337, 0, 266362, 0, 20807688, 0

Offset

0,37

Links

Table of n, a(n) for n=0..47.

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

Formula

a(n) = A186728(n) - A186729(n).

Crossrefs

Cf. A186728, A186729.

Sequence in context: A269035 A268904 A058896 * A222754 A181905 A350826

Adjacent sequences: A186745 A186746 A186747 * A186749 A186750 A186751

Keyword

nonn,more,hard

Author

Jason Kimberley, Apr 03 2012

Status

approved