cp's OEIS Frontend

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.

A005334 Number of labeled nonseparable (or 2-connected) bicolored graphs with n nodes of the first color and n nodes of the second color.

This page as a plain text file.
%I A005334 M5244 #24 Jan 08 2021 21:16:14
%S A005334 1,1,34,7037,6317926,21073662977,251973418941994,10878710974408306717,
%T A005334 1727230695707098000548430,1028983422758641650604161840065,
%U A005334 2342608062302306704492272616530549874,20683716767972841770515007707311751484424893
%N A005334 Number of labeled nonseparable (or 2-connected) bicolored graphs with n nodes of the first color and n nodes of the second color.
%C A005334 The two color classes are not interchangeable and have separate labels. Nonseparable graphs are also called blocks.
%D A005334 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A005334 Andrew Howroyd, <a href="/A005334/b005334.txt">Table of n, a(n) for n = 1..50</a>
%H A005334 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 A005334 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)
%Y A005334 Main diagonal of A123301 as an array.
%Y A005334 Cf. A005333, A005335, A005336.
%K A005334 nonn
%O A005334 1,3
%A A005334 _N. J. A. Sloane_
%E A005334 Name clarified and more terms added by _Andrew Howroyd_, Jan 03 2021