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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A185135 Number of not necessarily connected 3-regular simple graphs on 2n vertices with girth exactly 5. 8
0, 0, 0, 0, 0, 1, 2, 8, 48, 450, 5752, 90555, 1612917, 31297424, 652159986, 14499787794, 342646826428 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,7
LINKS
FORMULA
a(n) = A185335(n) - A185336(n).
a(n) = A006925(n) + A185035(n).
CROSSREFS
Not necessarily connected 3-regular simple graphs on 2n vertices with girth exactly g: A185130 (triangle); fixed g: A185133 (g=3), A185134 (g=4), this sequence (g=5), A185136 (g=6).
Sequence in context: A052667 A327904 A006925 * A238805 A005867 A280133
KEYWORD
nonn,hard,more
AUTHOR
Jason Kimberley, Mar 21 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 August 1 17:30 EDT 2024. Contains 374818 sequences. (Running on oeis4.)