[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A185036
Number of disconnected 3-regular simple graphs on 2n vertices with girth exactly 6.
5
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 6, 37, 432, 8119, 191254, 4855919, 127937854, 3482858263, 98176518258
(list; graph; refs; listen; history; text; internal format)
OFFSET
0,17
LINKS
Table of n, a(n) for n=0..24.
Jason Kimberley, Index of sequences counting disconnected k-regular simple graphs with girth exactly g
FORMULA
a(n) = A185236(n) - A185237(n).
CROSSREFS
Disconnected 3-regular simple graphs with girth exactly g: A185033 (g=3), A185034 (g=4), A185035 (g=5), this sequence (g=6), A185037 (g=7).
Sequence in context: A337552 A036358 A340029 * A185236 A041062 A240324
Adjacent sequences: A185033 A185034 A185035 * A185037 A185038 A185039
KEYWORD
nonn,more,hard
AUTHOR
Jason Kimberley, Feb 29 2012
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified October 5 00:34 EDT 2024. Contains 376526 sequences.
License Agreements, Terms of Use, Privacy Policy