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.

A005641 Number of 2-diregular digraphs with n nodes.

Original entry on oeis.org

1, 3, 8, 27, 131, 711, 5055, 41607, 389759, 4065605, 46612528, 581713045, 7846380548, 113718755478, 1762208816647, 29073392136390, 508777045979418
Offset: 2

Views

Author

Keywords

Comments

These graphs may have loops, whereas A219889 does not admit them. Both sequences do not admit multiedges. - R. J. Mathar, Mar 27 2019

References

  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Cf. A005642 (inverse Euler transform, connected graphs).