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.

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

This page as a plain text file.
%I A382157 #12 Jul 09 2025 05:08:21
%S A382157 1,1,3,9,46,473,13763,1121383
%N A382157 Number of n-node digraphs without loops, not necessarily connected, which are squares.
%C A382157 For the definition of the square of a graph, see A382180.
%Y A382157 Cf. A382180. A382158, A382159.
%K A382157 nonn,more
%O A382157 0,3
%A A382157 _N. J. A. Sloane_, Mar 24 2025, based on an email from _Brendan McKay_, Mar 18 2025