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!)
A198316 Number of, not necessarily connected, regular simple graphs on n vertices with girth exactly 6. 5
0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 2, 1, 2, 1, 7, 2, 35, 3, 389, 4, 7579, 6, 181233, 9, 4624493, 12, 122090019, 17, 3328899632, 24, 93988911093, 57 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,15

LINKS

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

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

FORMULA

a(n) = A186746(n) + A210716(n).

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

CROSSREFS

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

Sequence in context: A016543 A300585 A145999 * A011128 A245595 A146003

Adjacent sequences:  A198313 A198314 A198315 * A198317 A198318 A198319

KEYWORD

nonn,more,hard

AUTHOR

_Jason Kimberley_, Dec 13 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 20 13:59 EST 2020. Contains 332078 sequences. (Running on oeis4.)