login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Number of strongly connected oriented graphs on n labeled nodes.
4

%I #8 Jan 16 2022 17:46:03

%S 1,0,2,66,7998,2895570,3015624078,8890966977354,74079608267459142,

%T 1754419666770364130730,119163820122708911990211222,

%U 23431180614718394105521543222866,13448652672256961901980839022683943838,22684139279519345808802725789494254587951810

%N Number of strongly connected oriented graphs on n labeled nodes.

%H Andrew Howroyd, <a href="/A350730/b350730.txt">Table of n, a(n) for n = 1..50</a>

%o (PARI) StrongO(14) \\ See A350731 for program code.

%Y The unlabeled version is A350489.

%Y Row sums of A350731.

%Y Cf. A003030, A054941.

%K nonn

%O 1,3

%A _Andrew Howroyd_, Jan 11 2022