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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A185035 Number of disconnected 3-regular simple graphs on 2n vertices with girth exactly 5. 5
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 12, 67, 597, 7134, 107820, 1876672, 35924730, 741405102, 16356067055, 383931363314 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,12

LINKS

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

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

FORMULA

a(n) = A185235(n) - A185236(n).

CROSSREFS

Disconnected 3-regular simple graphs with girth exactly g: A185033 (g=3), A185034 (g=4), this sequence (g=5), A185036 (g=6), A185037 (g=7).

Sequence in context: A212389 A241074 A020062 * A185235 A226400 A000954

Adjacent sequences:  A185032 A185033 A185034 * A185036 A185037 A185038

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 November 13 00:25 EST 2019. Contains 329083 sequences. (Running on oeis4.)