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!)
A243393 Number of isomorphism classes of connected 3-regular loopless simple graphs with n vertices and with semi-edges allowed. 4
1, 1, 2, 6, 10, 29, 64, 194, 531, 1733, 5524, 19430, 69322, 262044, 1016740, 4101318, 16996157, 72556640, 317558689, 1424644848, 6536588420, 30647561117, 146647344812, 715511358833, 3556531372395, 17996244725780, 92634418530686, 484756161038264 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
Also: number of isomorphism classes of connected loopless simple graphs with maximum degree at most 3. - Brendan McKay, Mar 11 2020
LINKS
G. Brinkmann, N. Van Cleemput, T. Pisanski, Generation of various classes of trivalent graphs, Theoretical Computer Science 502, 2013, pp.16-29.
CROSSREFS
Sequence in context: A365542 A364879 A192616 * A102581 A152000 A038042
KEYWORD
nonn
AUTHOR
Nico Van Cleemput, Jun 04 2014
EXTENSIONS
a(24)-a(28) from Andrew Howroyd, Mar 20 2020
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 May 1 23:54 EDT 2024. Contains 372178 sequences. (Running on oeis4.)