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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A185043 Number of disconnected 4-regular simple graphs on n vertices with girth exactly 3. 8
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 3, 8, 25, 88, 377, 2026, 13349, 104593, 930571, 9124627, 96699740, 1095467916, 13175254799, 167460501260, 2241576473025 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,13

LINKS

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

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

FORMULA

a(n) = A033483(n) - A185244(n).

CROSSREFS

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

Disconnected 4-regular simple graphs with girth exactly g: this sequence (g=3), A185044 (g=4).

Sequence in context: A148800 A244278 A190343 * A033483 A130522 A006219

Adjacent sequences:  A185040 A185041 A185042 * A185044 A185045 A185046

KEYWORD

nonn,more,hard

AUTHOR

Jason Kimberley, Feb 29 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 April 18 08:37 EDT 2019. Contains 322209 sequences. (Running on oeis4.)