login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A185318 Number of, not necessarily connected, regular simple graphs on n vertices with girth at least 8. 8
1, 1, 2, 1, 2, 1, 2, 1, 3, 2, 3, 2, 3, 2, 3, 2, 4, 3, 5, 4, 6, 5, 7, 6, 9, 8, 11, 11, 14, 14, 19, 18, 23, 24, 30, 31, 41, 40, 61, 52, 217, 67, 4416, 86, 266463, 111, 20807816, 141 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

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

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

FORMULA

a(n) = A186728(n) + A185218(n).

CROSSREFS

Not necessarily connected regular simple graphs with girth at least g: A005176 (g=3), A185314 (g=4), A185315 (g=5), A185316 (g=6), A185317 (g=7), this sequence (g=8), A185319 (g=9).

Sequence in context: A336041 A176725 A085029 * A008622 A029414 A053275

Adjacent sequences:  A185315 A185316 A185317 * A185319 A185320 A185321

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 January 18 06:07 EST 2022. Contains 350440 sequences. (Running on oeis4.)