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,5

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

Prog

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

Crossrefs

Row sums of A350750.

The labeled version is A350730.

Cf. A001174, A035512, A086345, A350751.

Sequence in context: A012047 A012010 A012155 * A325214 A118193 A052271

Adjacent sequences: A350486 A350487 A350488 * A350490 A350491 A350492

Keyword

nonn

Author

Andrew Howroyd, Jan 01 2022

Status

approved