login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A184955 Number of connected 5-regular simple graphs on 2n vertices with girth exactly 5. 9
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 90 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,16

LINKS

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

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

CROSSREFS

Connected k-regular simple graphs with girth exactly 5: A185015 (k=2), A006925 (k=3), A184945 (k=4), this sequence (k=5).

Connected 5-regular simple graphs with girth at least g: A006821 (g=3), A058275 (g=4), A205295 (g=5).

Connected 5-regular simple graphs with girth exactly g: A184953 (g=3), A184954 (g=4), this sequence (g=5).

Sequence in context: A183880 A220318 A220341 * A205295 A292304 A337081

Adjacent sequences: A184952 A184953 A184954 * A184956 A184957 A184958

KEYWORD

nonn,more,hard

AUTHOR

Jason Kimberley, Feb 27 2011

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 26 18:12 EST 2022. Contains 358362 sequences. (Running on oeis4.)