%I M4172 #59 Dec 16 2020 17:51:03
%S 1,2,6,26,192,3014,127757,16853750,7343780765,10733574184956,
%T 52867617324773592,882178116079222400788,50227997322550920824045262,
%U 9837048598740665027344331562224,6681839615514161556535851222043192179,15867777966020615016665849049841756464001994
%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 allowing the color classes to be interchanged.
%D R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Marko Riedel, <a href="/A007139/b007139.txt">Table of n, a(n) for n = 0..30</a>
%H F. Harary, L. March and R. W. Robinson, <a href="https://doi.org/10.1068/b050031">On enumerating certain design problems in terms of bicolored graphs with no isolates</a>, Environment and Planning, B 5 (1978), 31-43.
%H F. Harary, L. March and R. W. Robinson, <a href="/A007139/a007139.pdf">On enumerating certain design problems in terms of bicolored graphs with no isolates</a>, Environment and Planning B: Urban Analytics and City Science, 5 (1978), 31-43. [Annotated scanned copy]
%H Marko Riedel, <a href="https://math.stackexchange.com/questions/1151538/">Cycle indices for K_{n,n} including shuffles and reflections</a>.
%H Marko Riedel, <a href="/A007139/a007139_4.maple.txt">Maple code for cycle indices of K_{n,n}</a>
%F a(n) = (A002724(n)+A122082(n))/2. - _Vladeta Jovovic_, Feb 27 2007
%Y Cf. A007140.
%K nonn
%O 0,2
%A _N. J. A. Sloane_
%E More terms from _Vladeta Jovovic_, Feb 27 2007
%E Edited by _N. J. A. Sloane_, Aug 14 2007
%E Name clarified by _Marko Riedel_, Jun 15 2017
%E More terms from _Marko Riedel_, Jun 16 2017