login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A185153 Number of not necessarily connected 5-regular simple graphs on 2n vertices with girth exactly 3. 6
0, 0, 0, 1, 3, 59, 7848, 3459379, 2585136353, 2807104852102 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,5

LINKS

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

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

FORMULA

a(n) = A165626(n) - A185354(n).

a(n) = A184953(n) + A185053(n).

CROSSREFS

Not necessarily connected k-regular simple graphs girth exactly 3: A198313 (any k), A185643 (triangle); fixed k: A026796 (k=2), A185133 (k=3), A185143 (k=4), this sequence (k=5), A185163 (k=6).

Sequence in context: A305597 A062629 A184953 * A215609 A201184 A046024

Adjacent sequences:  A185150 A185151 A185152 * A185154 A185155 A185156

KEYWORD

nonn,hard,more

AUTHOR

Jason Kimberley, Mar 12 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 June 22 21:29 EDT 2021. Contains 345393 sequences. (Running on oeis4.)