login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A128953 Number of 3-connected bipartite graphs on n unlabeled nodes. 0
1, 1, 6, 12, 85, 471, 5373, 75145, 1543382, 41554738 (list; graph; refs; listen; history; internal format)
OFFSET

6,3

EXAMPLE

a(6) = 1 because the complete bipartite graph K_{3,3} is the only 3-connected bipartite graph on 6 vertices.

CROSSREFS

Cf. A005142.

Sequence in context: A196253 A054883 A005402 * A181597 A002898 A003613

Adjacent sequences:  A128950 A128951 A128952 * A128954 A128955 A128956

KEYWORD

nonn

AUTHOR

Gordon Royle (gordon(AT)maths.uwa.edu.au), May 10 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 16:49 EST 2012. Contains 206058 sequences.