Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005644
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005644 Number of labeled 3-connected graphs with n nodes.
(Formerly M5190)
+0
3
1, 26, 1768, 225096, 51725352, 21132802544, 15463799747936, 20604021770403328, 50928019401158515328, 237644423948928994197504, 2125373296900166452199861760, 36884133903194627014531723872256 (list; graph; listen)
OFFSET

4,2

REFERENCES

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

R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976.

Walsh, T. R. S.; Counting labeled three-connected and homeomorphically irreducible two-connected graphs. J. Combin. Theory Ser. B 32 (1982), no. 1, 1-11.

LINKS

R. W. Robinson, Table of n, a(n) for n = 4..25

CROSSREFS

Row sums of A123542.

Sequence in context: A042303 A042300 A080163 this_sequence A123537 A054597 A005643

Adjacent sequences: A005641 A005642 A005643 this_sequence A005645 A005646 A005647

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

Corrected and extended Nov 13 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 14:49 EST 2009. Contains 167514 sequences.


AT&T Labs Research