A382158 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A382158

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

2

1, 1, 2, 6, 26, 209, 4115, 206205, 24982238

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

COMMENTS

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

LINKS

Table of n, a(n) for n=0..8.

CROSSREFS

Cf. A382180. A382157, A382159.

Sequence in context: A306147 A331937 A380030 * A162438 A137071 A255016

Adjacent sequences: A382155 A382156 A382157 * A382159 A382160 A382161

KEYWORD

nonn,more

AUTHOR

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

STATUS

approved