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 A003088 M2011 #23 Feb 20 2023 22:08:38 %S A003088 1,1,2,11,171,8603,1478644,870014637 %N A003088 Number of unilateral digraphs with n unlabeled nodes. %D A003088 F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 218. %D A003088 Ronald C. Read, email to _N. J. A. Sloane_, 28 August, 2000. %D A003088 R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998. %D A003088 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A003088 R. W. Robinson, <a href="http://dx.doi.org/10.1002/jgt.3190010215">Counting strong digraphs (research announcement)</a>, J. Graph Theory 1, 1977, pp. 189-190. %Y A003088 Cf. A057270, A003029 (labeled case), A003085, A035512, A051421, A049531, A049512. %K A003088 nonn,nice,more %O A003088 0,3 %A A003088 _N. J. A. Sloane_ %E A003088 Note that Read and Wilson incorrectly give a(4) as 172 - thanks to _Vladeta Jovovic_, Goran Kilibarda for finding this error and for verifying a(5). %E A003088 a(7) from _Sean A. Irvine_, Jan 26 2015