This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A185143 Number of not necessarily connected 4-regular simple graphs on n vertices with girth exactly 3. 9
 0, 0, 0, 0, 0, 1, 1, 2, 5, 16, 58, 264, 1535, 10755, 87973, 803973, 8020967, 86029760, 983431053, 11913921910, 152352965278, 2050065073002, 28466234288520 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,8 LINKS FORMULA a(n) = A033301(n) - A185344(n). a(n) = A184943(n) + A185043(n). CROSSREFS Not necessarily connected k-regular simple graphs girth exactly 3: A198313 (any k), A185643 (triangle); fixed k: A026796 (k=2), A185133 (k=3), this sequence (k=4), A185153 (k=5), A185163 (k=6). Not necessarily connected 4-regular simple graphs with girth exactly g: A185140 (triangle); fixed g: this sequence (g=3), A185144 (g=4). Sequence in context: A300042 A019448 A243326 * A280760 A000753 A007878 Adjacent sequences:  A185140 A185141 A185142 * A185144 A185145 A185146 KEYWORD nonn,hard,more AUTHOR Jason Kimberley, Mar 12 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 17 08:42 EDT 2019. Contains 325098 sequences. (Running on oeis4.)