%I M2878 #36 Sep 04 2019 08:06:22
%S 0,1,0,3,10,355,6986,297619,15077658,1120452771,111765799882,
%T 15350524923547,2875055248515242,738416821509929731,
%U 260316039943139322858,126430202628042630866787,84814075550928212558332858,78847417416749666369637926851
%N Number of labeled nonseparable bipartite graphs on n nodes.
%D Miklos Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015, p. 406.
%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 Andrew Howroyd, <a href="/A004100/b004100.txt">Table of n, a(n) for n = 1..100</a> (terms 1..32 from R. W. Robinson)
%H F. Harary and R. W. Robinson, <a href="http://dx.doi.org/10.4153/CJM-1979-007-3">Labeled bipartite blocks</a>, Canad. J. Math., 31 (1979), 60-68.
%H F. Harary and R. W. Robinson, <a href="/A001832/a001832.pdf">Labeled bipartite blocks</a>, Canad. J. Math., 31 (1979), 60-68. (Annotated scanned copy)
%H A. Nymeyer and R. W. Robinson, <a href="/A000684/a000684.pdf">Tabulation of the Numbers of Labeled Bipartite Blocks and Related Classes of Bicolored Graphs</a>, 1982 [Annotated scanned copy of unpublished MS and letter from R.W.R.]
%t b[n_] := Log[Sum[Exp[2^k*x + O[x]^n]*x^k/k!, {k, 0, n}]/2];
%t seq[n_] := CoefficientList[-Log[2] + Log[x/InverseSeries[x*D[b[n], x]]], x]*Table[(2k)!!, {k, 0, n-2}];
%t seq[19] (* _Jean-François Alcover_, Sep 04 2019, after _Andrew Howroyd_ *)
%o (PARI) \\ here b(n) is A001832 as e.g.f.
%o b(n)={log(sum(k=0, n, exp(2^k*x + O(x*x^n))*x^k/k!))/2}
%o seq(n)={Vec(serlaplace(log(x/serreverse(x*deriv(b(n))))), -n)} \\ _Andrew Howroyd_, Sep 26 2018
%Y Cf. A001832, A013922.
%K nonn,nice,easy
%O 1,4
%A _N. J. A. Sloane_
%E a(16) onwards added by _N. J. A. Sloane_, Oct 19 2006 from the Robinson reference