This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A350489 #19 Jan 16 2022 08:23:00 %S A350489 1,1,0,1,4,76,4232,611528,222688092,205040866270,484396550160186, %T A350489 2987729989350536868,48933147333828638153224, %U A350489 2160018687398735805070288200,260218032038985813416099131315377,86440094822917159858790627703492969772 %N A350489 Number of strongly connected oriented graphs on n unlabeled nodes. %H A350489 Andrew Howroyd, <a href="/A350489/b350489.txt">Table of n, a(n) for n = 0..50</a> %H A350489 Andrew Howroyd, <a href="/A350489/a350489.txt">PARI Program</a>, Jan 2022. %H A350489 R. W. Robinson, <a href="http://cobweb.cs.uga.edu/~rwr/publications/components.pdf">Counting digraphs with restrictions on the strong components</a>, Combinatorics and Graph Theory '95 (T.-H. Ku, ed.), World Scientific, Singapore (1995), 343-354. %H A350489 Wikipedia, <a href="https://en.wikipedia.org/wiki/Strongly_connected_component">Strongly connected component</a> %o A350489 (PARI) A350489seq(15) \\ See Links for program code. %Y A350489 Row sums of A350750. %Y A350489 The labeled version is A350730. %Y A350489 Cf. A001174, A035512, A086345, A350751. %K A350489 nonn %O A350489 0,5 %A A350489 _Andrew Howroyd_, Jan 01 2022