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

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A319612 Number of regular simple graphs spanning n vertices. 14
 1, 0, 1, 1, 7, 13, 171, 931, 45935, 1084413, 155862511, 10382960971, 6939278572095, 2203360500122299, 4186526756621772343, 3747344008241368443819, 35041787059691023579970847, 156277111373303386104606663421, 4142122641757598618318165240180095 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS A graph is regular if all vertices have the same degree. The span of a graph is the union of its edges. LINKS FORMULA a(n) = A295193(n) - 1. EXAMPLE The a(4) = 7 edge-sets:   {{1,2},{3,4}}   {{1,3},{2,4}}   {{1,4},{2,3}}   {{1,2},{1,3},{2,4},{3,4}}   {{1,2},{1,4},{2,3},{3,4}}   {{1,3},{1,4},{2,3},{2,4}}   {{1,2},{1,3},{1,4},{2,3},{2,4},{3,4}} CROSSREFS Cf. A002829, A005176, A110100, A116539, A295193, A306017, A319189, A319190. Sequence in context: A198947 A050946 A178956 * A247946 A210465 A181492 Adjacent sequences:  A319609 A319610 A319611 * A319613 A319614 A319615 KEYWORD nonn AUTHOR Gus Wiseman, Dec 17 2018 EXTENSIONS a(16)-a(18) from Andrew Howroyd, Sep 02 2019 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 January 21 22:47 EST 2020. Contains 331129 sequences. (Running on oeis4.)