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 A331013 #10 Jan 08 2020 07:41:26
%S A331013 1,4,13,104,1507,64203,8426875,3671999389,5366787092478,
%T A331013 26433809041087192,441089058039611200394,25113998661290096278734134,
%U A331013 4918524299370332513672165781112,3340919807757080784843712707230030713,7933888983010307508332924524920878232000997,66370395190630232518212377765981306426650525779505
%N A331013 Number of unlabeled bicolored bipartite graphs on 2n nodes having n nodes of each color with no edges between vertices of the same color and edges having two colors and allowing the node color classes to be interchanged. Edge colors are swappable (permuted by the symmetric group).
%C A331013 Color swaps of the node colors are reflections of the biclique about a vertical axis, with one part on the left and the other on the right. Edge colors are distinct from the two node colors.
%D A331013 E. Palmer and F. Harary, Graphical Enumeration, Academic Press, 1973.
%H A331013 Marko Riedel, Math.StackExchange, <a href="https://math.stackexchange.com/questions/3496545/">Counting bicliques</a>
%H A331013 Marko Riedel, <a href="/A331013/a331013_1.maple.txt">Cycle indices for K_{n,n} including shuffles and reflections as well as Power Group Enumeration implementation.</a>
%Y A331013 Cf. A007139, A331014.
%K A331013 nonn
%O A331013 1,2
%A A331013 _Marko Riedel_, Jan 06 2020