|
%I #7 Jan 15 2022 12:29:22
%S 1,1,2,7,91,5144,1052251,706480081,1581055927702,12140606592270147,
%T 328173093539912361767,31831409057653120420337536,
%U 11234306829106179168513020426663,14576263867478482708779036941179024765,70075728362112833245095630646535639894359350
%N Number of semi-strong digraphs on n unlabeled nodes.
%C A digraph is semi-strong if all its weakly connected components are strongly connected.
%H Andrew Howroyd, <a href="/A350754/b350754.txt">Table of n, a(n) for n = 0..50</a>
%F Euler transform of A035512.
%Y The labeled version is A054948.
%Y Row sums of A106238.
%Y Cf. A035512.
%K nonn
%O 0,3
%A _Andrew Howroyd_, Jan 14 2022
| 