A006289 - OEIS

%I M3058 #24 Nov 25 2020 08:01:25

%S 1,3,19,149,2581,84151,5201856,577050233,113372069299,39618015318982,

%T 24916462761069296,28563626972509456884,60366734349116636660402,

%U 237406975840304068884168139,1750330441810569047176394509086

%N Number of series-reduced 2-connected graphs with n nodes.

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H Andrew Howroyd, <a href="/A006289/b006289.txt">Table of n, a(n) for n = 4..25</a>

%H R. W. Robinson, <a href="http://cobweb.cs.uga.edu/~rwr/publications/tables.pdf">Tables</a>

%H R. W. Robinson, <a href="/A002218/a002218_2.pdf">Tables</a> [Local copy, with permission]

%H R. W. Robinson and T. R. S. Walsh, <a href="http://www.cs.uga.edu/~rwr/publications/cycleindex.pdf">Inversion of cycle index sum relations for 2- and 3-connected graphs</a>, J. Combin. Theory Ser. B. 57 (1993), 289-308. See <a href="https://doi.org/10.1006/jctb.1993.1022">also</a>.

%H T. R. S. Walsh, <a href="https://doi.org/10.1016/0095-8956(82)90072-7">Counting unlabeled three-connected and homeomorphically irreducible two-connected graphs</a>, J. Combin. Theory Ser. B 32 (1982), no. 1, 12-32.

%Y Row sums of A339069.

%Y Cf. A006290, A339068.

%K nonn,nice

%O 4,2

%A _N. J. A. Sloane_

%E Robinson and Walsh list first 25 terms.