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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A185053 Number of disconnected 5-regular simple graphs on 2n vertices with girth exactly 3. 7
0, 0, 0, 0, 0, 0, 1, 3, 66, 8029, 3484759, 2595985769, 2815099031409 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,8

LINKS

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

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

FORMULA

a(n) = A165655(n) - A185254(n).

CROSSREFS

Disconnected k-regular simple graphs with girth exactly 3: A210713 (any k), A210703 (triangle); for fixed k: A185033 (k=3), A185043 (k=4), this sequence (k=5), A185063 (k=6).

Sequence in context: A157984 A187547 A157554 * A165655 A157576 A105443

Adjacent sequences:  A185050 A185051 A185052 * A185054 A185055 A185056

KEYWORD

nonn,hard,more

AUTHOR

Jason Kimberley, Mar 10 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 May 25 00:59 EDT 2019. Contains 323534 sequences. (Running on oeis4.)