cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

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

Original entry on oeis.org

1, 1, 3, 4, 11, 23, 63, 159, 459, 1331, 4083, 12750
Offset: 3

Views

Author

Robert W. Robinson

Keywords

References

  • Calculated by Sridar K. Pootheri.

Links

Crossrefs

Cf. A324410.

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

A324417 Number of minimally 10-edge-connected non-isomorphic n-vertex graphs.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 25, 2498
Offset: 1

Views

Author

Jens M. Schmidt, Mar 03 2019

Keywords

Links

Crossrefs

Cf. A001072, A324410.
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.