login
Number of digraphs on n unlabeled nodes whose strongly connected components are complete digraphs.
2

%I #6 Mar 16 2023 19:46:35

%S 1,1,3,12,88,1217,34672,2039085,246005109,60296886108,29828186693218,

%T 29663937774464786,59172529527454608139,236453014376786629601848,

%U 1891427400988740573006253862,30274661556583530830890359188257,969429810937979825934973090455224882

%N Number of digraphs on n unlabeled nodes whose strongly connected components are complete digraphs.

%o (PARI) A361583seq(16) \\ See PARI link in A350794 for program code.

%Y The labeled version is A361560.

%Y Cf. A000273, A350794, A361584, A361585.

%K nonn

%O 0,3

%A _Andrew Howroyd_, Mar 16 2023