Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A120388
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A120388 Number of connected 2-colored graphs with n vertices and at least one edge that are minimal with respect to bisimilarity. +0
1
2, 4, 20, 173, 2612, 66900, 2851540, 201613875 (list; graph; listen)
OFFSET

1,1

LINKS

J. Behrstock and W.D. Neumann, Quasi-isometric classification of graph manifold groups

CROSSREFS

Sequence in context: A102087 A052573 A110371 this_sequence A061348 A127103 A059831

Adjacent sequences: A120385 A120386 A120387 this_sequence A120389 A120390 A120391

KEYWORD

hard,nonn

AUTHOR

Walter D Neumann (neumann(AT)math.columbia.edu), Jun 30 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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research