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.

A319896 Number of connected non-regular multigraphs with n nodes of degree up to n.

Original entry on oeis.org

0, 1, 0, 3, 31, 595, 33931, 6020479, 3613415171
Offset: 0

Views

Author

Natan Arie Consigli, Sep 30 2018

Keywords

Comments

Multigraphs are loopless.
Terms computed using nauty traces.

Links

Crossrefs

Cf. A289988, A289986, A319897.

Formula

a(n) = A289988(n) - A319897(n).

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

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