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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A185037 Number of disconnected 3-regular simple graphs on 2n vertices with girth exactly 7. 4
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 3, 27, 609, 32237, 1885410, 101214661, 5025320937 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,26

LINKS

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

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

FORMULA

a(n) = A185237(n) - A185238(n).

CROSSREFS

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

Sequence in context: A062496 A222844 A219345 * A185237 A099084 A085656

Adjacent sequences:  A185034 A185035 A185036 * A185038 A185039 A185040

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 6 08:53 EST 2016. Contains 278775 sequences.