login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A186743 Number of connected regular simple graphs on n vertices with girth exactly 3. 2
0, 0, 0, 1, 1, 1, 3, 3, 13, 21, 157, 536, 18942, 389404, 50314456, 2942196832, 1698517018391 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,7

LINKS

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

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

FORMULA

a(n) = A005177(n) - A186724(n).

CROSSREFS

Connected k-regular simple graphs with girth exactly 3: this sequence (any k), A186733 (triangular array); specified k: A006923 (k=3),A184943 (k=4), A184953 (k=5), A184963 (k=6), A184973 (k=7),A184983 (k=8), A184993 (k=9).

Sequence in context: A095336 A072552 A217246 * A219314 A288146 A019154

Adjacent sequences:  A186740 A186741 A186742 * A186744 A186745 A186746

KEYWORD

nonn,more,hard

AUTHOR

Jason Kimberley, Dec 01 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 31 16:44 EDT 2020. Contains 333151 sequences. (Running on oeis4.)