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!)
A186746 Number of connected regular simple graphs on n vertices with girth exactly 6. 1
0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 5, 0, 32, 0, 385, 0, 7573, 0, 181225, 0, 4624481, 0, 122090002, 0, 3328899605, 0, 93988911027, 25, 2754128020324, 13504 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,19

LINKS

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

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

FORMULA

a(n) = A186726(n) - A186727(n).

CROSSREFS

Cf. A186726, A186727.

Sequence in context: A279548 A279701 A279604 * A208928 A297206 A103709

Adjacent sequences:  A186743 A186744 A186745 * A186747 A186748 A186749

KEYWORD

nonn,more,hard

AUTHOR

Jason Kimberley, Apr 03 2012

EXTENSIONS

a(36)-a(37) from Jinyuan Wang, Mar 02 2020

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 April 5 10:33 EDT 2020. Contains 333239 sequences. (Running on oeis4.)