This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A185334 Number of not necessarily connected 3-regular simple graphs on 2n vertices with girth at least 4. 13
 1, 0, 0, 1, 2, 6, 23, 112, 801, 7840, 97723, 1436873, 23791155, 432878091, 8544173926, 181519645163, 4127569521160 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS The null graph on 0 vertices is vacuously 3-regular; since it is acyclic, it has infinite girth. LINKS Jason Kimberley, Not necessarily connected k-regular graphs with girth at least 4 FORMULA Euler transformation of A014371. CROSSREFS 3-regular simple graphs with girth at least 4: A014371 (connected), A185234 (disconnected), this sequence (not necessarily connected). Not necessarily connected k-regular simple graphs with girth at least 4: A185314 (any k), A185304 (triangle); specified degree k: A008484 (k=2), this sequence (k=3), A185344 (k=4), A185354 (k=5), A185364 (k=6). Not necessarily connected 3-regular simple graphs with girth *at least* g: A005638 (g=3), this sequence (g=4), A185335 (g=5), A185336 (g=6). Not necessarily connected 3-regular simple graphs with girth *exactly* g: A185133 (g=3), A185134 (g=4), A185135 (g=5), A185136 (g=6). Sequence in context: A063255 A117158 A317128 * A290280 A059513 A132647 Adjacent sequences:  A185331 A185332 A185333 * A185335 A185336 A185337 KEYWORD nonn,more,hard AUTHOR Jason Kimberley, Feb 15 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.

Last modified July 15 20:24 EDT 2019. Contains 325056 sequences. (Running on oeis4.)