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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A185136 Number of not necessarily connected 3-regular simple graphs on 2n vertices with girth exactly 6. 8
0, 0, 0, 0, 0, 0, 0, 1, 1, 5, 32, 385, 7573, 181224, 4624481, 122089999, 3328899592, 93988909792 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,10

LINKS

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

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

FORMULA

a(n) = A006926(n) + A185036(n).

CROSSREFS

Not necessarily connected 3-regular simple graphs on 2n vertices with girth exactly g: A185130 (triangle); fixed g: A185133 (g=3), A185134 (g=4), A185135 (g=5), this sequence (g=6).

Sequence in context: A094653 A135250 A006926 * A014374 A185336 A125709

Adjacent sequences:  A185133 A185134 A185135 * A185137 A185138 A185139

KEYWORD

nonn,hard,more

AUTHOR

Jason Kimberley, Mar 21 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 20 22:22 EDT 2019. Contains 322310 sequences. (Running on oeis4.)