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!)
A198313 Number of, not necessarily connected, regular simple graphs on n vertices with girth exactly 3. 11
0, 0, 0, 1, 1, 1, 4, 4, 15, 23, 162, 540, 18958, 389417, 50314520, 2942196930, 1698517018988 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,7
LINKS
FORMULA
a(n) = A186743(n) + A210713(n).
a(n) = A005176(n) - A185314(n).
a(n) is the sum of the n-th row of A185643.
CROSSREFS
Not necessarily connected k-regular simple graphs girth exactly 3: this sequence (any k), A185643 (triangle); fixed k: A026796 (k=2), A185133 (k=3), A185143 (k=4), A185153 (k=5), A185163 (k=6).
Not necessarily connected regular simple graphs girth exactly g: this sequence (g=3), A198314 (g=4), A198315 (g=5), A198316 (g=6), A198317 (g=7), A198318 (g=8).
Sequence in context: A138767 A048282 A068592 * A219350 A222511 A135944
KEYWORD
nonn,more,hard
AUTHOR
Jason Kimberley, May 24 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 March 29 02:23 EDT 2024. Contains 371264 sequences. (Running on oeis4.)