%I #10 Jan 08 2020 07:41:31
%S 1,6,84,7946,5413511,25231086540,800871112032930,
%T 177544715836044855636,281653040526999655665449719,
%U 3266495639384107667257990172349726,282129919925994006382238965837655927175534,184379837924757642947198903200667422197524750679153
%N 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 three colors and allowing the node color classes to be interchanged. Edge colors are swappable (permuted by the symmetric group).
%C 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 E. Palmer and F. Harary, Graphical Enumeration, Academic Press, 1973.
%H Marko Riedel, Math.StackExchange, <a href="https://math.stackexchange.com/questions/3496545/">Counting bicliques</a>
%Y Cf. A007139, A331013.
%K nonn
%O 1,2
%A _Marko Riedel_, Jan 06 2020