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.

A382157 Number of n-node digraphs without loops, not necessarily connected, which are squares.

Original entry on oeis.org

1, 1, 3, 9, 46, 473, 13763, 1121383
Offset: 0

Views

Author

N. J. A. Sloane, Mar 24 2025, based on an email from Brendan McKay, Mar 18 2025

Keywords

Comments

For the definition of the square of a graph, see A382180.

Crossrefs

Cf. A382180. A382158, A382159.

A382158 Number of n-node oriented graphs (no loops or cycles of length 2), not necessarily connected, which are squares.

Original entry on oeis.org

1, 1, 2, 6, 26, 209, 4115, 206205, 24982238
Offset: 0

Views

Author

N. J. A. Sloane, Mar 24 2025, based on an email from Brendan McKay, Mar 18 2025

Keywords

Comments

For the definition of the square of a graph, see A382180.

Crossrefs

Cf. A382180. A382157, A382159.
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.