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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A319115 Number of simple connected toroidal graphs on n nodes. 0
 0, 0, 0, 0, 1, 13, 207, 5128 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 COMMENTS a(n) <= A145270(n). a(n) = A145270(n) for n < 8. a(8) = A145270(8) - 15 since there are 15 double-toroidal graphs on 8 nodes, all of which are connected. LINKS Eric Weisstein's World of Mathematics, Connected Graph Eric Weisstein's World of Mathematics, Simple Graph Eric Weisstein's World of Mathematics, Toroidal Graph CROSSREFS Cf. A145270 (simple connected nonplanar graphs). Sequence in context: A243783 A206348 A240393 * A145270 A296671 A196328 Adjacent sequences: A319112 A319113 A319114 * A319116 A319117 A319118 KEYWORD nonn,more AUTHOR Eric W. Weisstein, Sep 10 2018 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.

Last modified November 28 17:22 EST 2022. Contains 358421 sequences. (Running on oeis4.)