|
%I M3039 #45 Feb 20 2023 22:08:38
%S 1,3,17,136,2388,80890,5114079,573273505,113095167034,39582550575765,
%T 24908445793058442,28560405143495819079,60364410130177223014724,
%U 237403933018799958309530349,1750323137355778190158082029500,24333358813699371350715221107464003,640811613278752754485012443963579501421
%N Number of 3-connected graphs with n nodes.
%C Robinson and Walsh list first 25 terms.
%D R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Andrew Howroyd, <a href="/A006290/b006290.txt">Table of n, a(n) for n = 4..25</a>
%H Steven R. Finch, <a href="https://doi.org/10.1017/9781316997741">Mathematical Constants II</a>, Encyclopedia of Mathematics and Its Applications, Cambridge University Press, Cambridge, 2018.
%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="https://doi.org/10.1006/jctb.1993.1022">Inversion of cycle index sum relations for 2- and 3-connected graphs</a>, J. Combin. Theory Ser. B. 57 (1993), 289-308.
%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.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/k-ConnectedGraph.html">k-Connected Graph</a>
%H David Kofoed Wind, <a href="/A006290/a006290.pdf">Connected Graphs with Fewest Spanning Trees</a>, Bachelor Thesis, Spring 2011.
%Y Row sums of A339072.
%Y Cf. A000088, A001349, A002218, A006289, A007112, A338511.
%K nonn,nice
%O 4,2
%A _N. J. A. Sloane_
%E More terms from Ronald C. Read.
|
