login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A186748 Number of connected regular simple graphs on n vertices with girth exactly 8. 1
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 (list; graph; refs; listen; history; text; internal format)
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

Sequence in context: A269035 A268904 A058896 * A222754 A181905 A008403

Adjacent sequences:  A186745 A186746 A186747 * A186749 A186750 A186751

KEYWORD

nonn,more,hard

AUTHOR

Jason Kimberley, Apr 03 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 5 07:06 EDT 2020. Contains 335460 sequences. (Running on oeis4.)