%I A001832 M3063 N1241
%S A001832 1,1,3,19,195,3031,67263,2086099,89224635,5254054111,426609529863,
%T A001832 47982981969979,7507894696005795,1641072554263066471,
%U A001832 502596525992239961103,216218525837808950623459,130887167385831881114006475
%N A001832 Number of labeled connected bipartite graphs on n nodes.
%D A001832 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A001832 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A001832 F. Harary and R. W. Robinson, Labeled bipartite blocks, Canad. J. Math., 
               31 (1979), 60-68.
%D A001832 D. A. Klarner, The number of graded partially ordered sets, J. Combin. 
               Theory, 6 (1969), 12-19.
%D A001832 A. Nymeyer and R. W. Robinson, ``Tabulation of the Numbers of Labeled 
               Bipartite Blocks and Related Classes of Bicolored Graphs,'' unpublished 
               manuscript, 1982.
%D A001832 R. W. Robinson, Numerical implementation of graph counting algorithms, 
               AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976.
%H A001832 R. W. Robinson, <a href="b001832.txt">Table of n, a(n) for n = 1..32</
               a>
%H A001832 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               n-ColorableGraph.html">n-Colorable Graph</a>
%H A001832 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               n-ChromaticGraph.html">n-Chromatic Graph</a>
%Y A001832 Cf. A002031.
%Y A001832 Sequence in context: A053554 A079145 A000763 this_sequence A123681 A007151 
               A127502
%Y A001832 Adjacent sequences: A001829 A001830 A001831 this_sequence A001833 A001834 
               A001835
%K A001832 nonn,nice,easy
%O A001832 1,3
%A A001832 N. J. A. Sloane (njas(AT)research.att.com).
%E A001832 More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 12 2003