Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128953
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128953 Number of 3-connected bipartite graphs on n unlabeled nodes. +0
1
1, 1, 6, 12, 85, 471, 5373, 75145, 1543382, 41554738 (list; graph; listen)
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: A061520 A054883 A005402 this_sequence A002898 A003613 A099767

Adjacent sequences: A128950 A128951 A128952 this_sequence A128954 A128955 A128956

KEYWORD

nonn

AUTHOR

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

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 December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research