login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The On-Line Encyclopedia of Integer Sequences
!)
A185238
Number of disconnected 3-regular simple graphs on 2n vertices with girth at least 8.
1
0, 0, 0, 0, 0, 0, 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, 0, 1, 3, 14, 158, 4356, 266556, 20812581
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
0,34
LINKS
Table of n, a(n) for n=0..38.
Jason Kimberley,
Index of sequences counting disconnected k-regular simple graphs with girth at least g
CROSSREFS
Sequence in context:
A075654
A330603
A261006
*
A090897
A120459
A272368
Adjacent sequences:
A185235
A185236
A185237
*
A185239
A185240
A185241
KEYWORD
nonn
,
more
,
hard
AUTHOR
Jason Kimberley
, Feb 22 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 April 25 16:45 EDT 2024. Contains 371989 sequences. (Running on oeis4.)