login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The On-Line Encyclopedia of Integer Sequences
!)
A186747
Number of connected regular simple graphs on n vertices with girth exactly 7.
1
0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 3, 0, 21, 0, 545, 0, 30368, 0, 1782839, 0, 95079080, 0, 4686063107, 0
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
0,27
LINKS
Table of n, a(n) for n=0..39.
Jason Kimberley,
Index of sequences counting connected k-regular simple graphs with girth exactly g
FORMULA
a(n) =
A186727
(n) -
A186728
(n).
CROSSREFS
Sequence in context:
A009353
A215583
A215678
*
A083289
A108196
A370015
Adjacent sequences:
A186744
A186745
A186746
*
A186748
A186749
A186750
KEYWORD
nonn
,
more
,
hard
AUTHOR
Jason Kimberley
, Apr 03 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
|
Recents
The OEIS Community
| Maintained by
The OEIS Foundation Inc.
License Agreements, Terms of Use, Privacy Policy.
.
Last modified April 23 11:35 EDT 2024. Contains 371912 sequences. (Running on oeis4.)