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!)
A001072 Number of minimally 2-edge-connected non-isomorphic graphs with n nodes. 13

%I #18 Jan 19 2021 20:17:56

%S 1,1,3,4,11,23,63,159,459,1331,4083,12750

%N Number of minimally 2-edge-connected non-isomorphic graphs with n nodes.

%D Calculated by Sridar K. Pootheri.

%H F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version d0efd85.

%H Jens M. Schmidt, <a href="/A324088/a324088.html">Data files in graph6 format</a>

%Y Cf. A324410.

%K nonn,hard,more

%O 3,3

%A _Robert W. Robinson_

%E a(11) and a(12) added using tinygraph by _Falk Hüffner_, Jan 20 2016

%E a(13) and a(14) added by _Jens M. Schmidt_, Feb 27 2019

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 April 25 16:45 EDT 2024. Contains 371989 sequences. (Running on oeis4.)