login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A186745 Number of connected regular simple graphs on n vertices with girth exactly 5. 1
0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 2, 0, 8, 0, 48, 0, 450, 1, 5753, 8, 90684, 3917, 1736764, 4131991, 163457964, 4018022149, 119021971348 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,13

LINKS

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

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

FORMULA

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

CROSSREFS

Sequence in context: A103424 A211163 A239275 * A109573 A305809 A159810

Adjacent sequences:  A186742 A186743 A186744 * A186746 A186747 A186748

KEYWORD

nonn,more,hard

AUTHOR

Jason Kimberley, Apr 03 2012

EXTENSIONS

a(26) corrected by the author, due to correction of A186725, May 19 2017

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 May 21 00:57 EDT 2019. Contains 323429 sequences. (Running on oeis4.)