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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A185063 Number of disconnected 6-regular simple graphs on n vertices with girth exactly 3. 5
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 5, 25, 297, 8199, 377004, 22014143, 1493574756, 114880777582, 9919463450854 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,17

LINKS

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

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

FORMULA

a(n) = A165656(n) - A185264(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), A185053 (k=5), this sequence (k=6).

Sequence in context: A209529 A184958 A145076 * A165656 A145773 A197195

Adjacent sequences:  A185060 A185061 A185062 * A185064 A185065 A185066

KEYWORD

nonn,more,hard

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 03:14 EDT 2019. Contains 323539 sequences. (Running on oeis4.)