A350489 Number of strongly connected oriented graphs on n unlabeled nodes.

1, 1, 0, 1, 4, 76, 4232, 611528, 222688092, 205040866270, 484396550160186, 2987729989350536868, 48933147333828638153224, 2160018687398735805070288200, 260218032038985813416099131315377, 86440094822917159858790627703492969772

Offset: 0

Author

Andrew Howroyd, Jan 01 2022

Keywords

• nonn

Links

• Andrew Howroyd, Table of n, a(n) for n = 0..50
• Andrew Howroyd, PARI Program, Jan 2022.
• R. W. Robinson, Counting digraphs with restrictions on the strong components, Combinatorics and Graph Theory '95 (T.-H. Ku, ed.), World Scientific, Singapore (1995), 343-354.
• Wikipedia, Strongly connected component

Crossrefs

Row sums of A350750.

The labeled version is A350730.

Cf. A001174, A035512, A086345, A350751.

Programs

PARI

A350489seq(15) \\ See Links for program code.