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

 

Logo

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!)
A001072 Number of minimally 2-edge-connected non-isomorphic graphs with n nodes. 13
1, 1, 3, 4, 11, 23, 63, 159, 459, 1331, 4083, 12750 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,3

REFERENCES

Calculated by Sridar K. Pootheri.

LINKS

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

F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version d0efd85.

Jens M. Schmidt, Data files in graph6 format

CROSSREFS

Cf. A324410.

Sequence in context: A005218 A219514 A131481 * A292623 A077900 A208176

Adjacent sequences:  A001069 A001070 A001071 * A001073 A001074 A001075

KEYWORD

nonn,hard,more

AUTHOR

Robert W. Robinson

EXTENSIONS

a(11) and a(12) added using tinygraph by Falk Hüffner, Jan 20 2016

a(13) and a(14) added by Jens M. Schmidt, Feb 27 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 January 21 16:47 EST 2020. Contains 331114 sequences. (Running on oeis4.)