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

 

Logo

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A324231 Number of simple 8-edge-connected non-isomorphic n-vertex graphs. 1
0, 0, 0, 0, 0, 0, 0, 0, 1, 6, 156, 36327, 77423446, 349501900040 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,10

LINKS

Table of n, a(n) for n=1..14.

Jens M. Schmidt, Data files in graph6 format

CROSSREFS

Cf. A007146, A052447.

Sequence in context: A237529 A306496 A282564 * A283728 A030449 A120277

Adjacent sequences:  A324228 A324229 A324230 * A324232 A324233 A324234

KEYWORD

nonn,more

AUTHOR

Jens M. Schmidt, Feb 19 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 8 20:37 EST 2021. Contains 349596 sequences. (Running on oeis4.)