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!)
A198317 Number of, not necessarily connected, regular simple graphs on n vertices with girth exactly 7. 5
0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 4, 4, 7, 5, 27, 7, 553, 10, 30379, 13, 1782854, 18, 95079100, 24, 4686063134, 32 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,22

LINKS

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

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

FORMULA

a(n) = A186747(n) + A210717(n).

a(n) = A185317(n) - A185318(n).

CROSSREFS

Not necessarily connected regular simple graphs girth exactly g: A198313 (g=3), A198314 (g=4), A198315 (g=5), A198316 (g=6), this sequence (g=7), A198318 (g=8).

Sequence in context: A225482 A004056 A284334 * A036822 A056099 A084848

Adjacent sequences:  A198314 A198315 A198316 * A198318 A198319 A198320

KEYWORD

nonn,more,hard

AUTHOR

Jason Kimberley, Dec 18 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 February 23 07:31 EST 2020. Contains 332159 sequences. (Running on oeis4.)