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-7 of 7 results.

A324410 Number of minimally 3-edge-connected non-isomorphic n-vertex graphs.

Original entry on oeis.org

0, 0, 0, 1, 1, 4, 8, 34, 118, 613, 3240, 20207
Offset: 1

Views

Author

Jens M. Schmidt, Feb 27 2019

Keywords

Crossrefs

A324411 Number of minimally 4-edge-connected non-isomorphic n-vertex graphs.

Original entry on oeis.org

0, 0, 0, 0, 1, 1, 5, 17, 114, 940, 11275, 167504
Offset: 1

Views

Author

Jens M. Schmidt, Feb 27 2019

Keywords

Crossrefs

A324412 Number of minimally 5-edge-connected non-isomorphic n-vertex graphs.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 1, 7, 32, 483, 10877, 386198
Offset: 1

Views

Author

Jens M. Schmidt, Feb 27 2019

Keywords

Crossrefs

A324413 Number of minimally 6-edge-connected non-isomorphic n-vertex graphs.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 1, 9, 71, 2516, 176323
Offset: 1

Views

Author

Jens M. Schmidt, Feb 27 2019

Keywords

Crossrefs

A324414 Number of minimally 7-edge-connected non-isomorphic n-vertex graphs.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 1, 1, 12, 167, 15891
Offset: 1

Views

Author

Jens M. Schmidt, Feb 27 2019

Keywords

Crossrefs

A324415 Number of minimally 8-edge-connected non-isomorphic n-vertex graphs.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 15, 375, 116394
Offset: 1

Views

Author

Jens M. Schmidt, Feb 27 2019

Keywords

Crossrefs

A324416 Number of minimally 9-edge-connected non-isomorphic n-vertex graphs.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 20, 1107
Offset: 1

Views

Author

Jens M. Schmidt, Feb 27 2019

Keywords

Crossrefs

Showing 1-7 of 7 results.