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 A052332 #11 Apr 13 2017 14:27:38
%S A052332 1,0,2,6,50,510,7682,161406,4747010,194342910,11084390402,
%T A052332 881008805886,97779099906050,15178191426486270,3302331237256396802,
%U A052332 1008694542117649154046,433286992912494943469570
%N A052332 Number of labeled digraphs where every node has indegree 0 or outdegree 0 and no isolated nodes.
%C A052332 Also labeled graphs with 2-colored nodes with no isolated nodes where black nodes are only connected to white nodes and vice versa.
%F A052332 a(n) = Sum_{k=0..n} (-1)^(n-k)*binomial(n, k)*A001831(k)
%F A052332 a(n) = Sum_{k=0..n} binomial(n, k)*(2^k-2)^(n-k). - _Vladeta Jovovic_, Apr 04 2003
%Y A052332 Cf. A001831 (binomial transform), A002031, A047863.
%K A052332 nonn
%O A052332 0,3
%A A052332 _Christian G. Bower_, Dec 15 1999
%E A052332 Last 4 terms corrected by _Vladeta Jovovic_, Apr 04 2003