The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A350489 Number of strongly connected oriented graphs on n unlabeled nodes. 11
 1, 1, 0, 1, 4, 76, 4232, 611528, 222688092, 205040866270, 484396550160186, 2987729989350536868, 48933147333828638153224, 2160018687398735805070288200, 260218032038985813416099131315377, 86440094822917159858790627703492969772 (list; graph; refs; listen; history; text; internal format)
 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 2 20:20 EST 2023. Contains 367526 sequences. (Running on oeis4.)