login
A120388
Number of connected 2-colored graphs with n vertices and at least one edge that are minimal with respect to bisimilarity.
0
2, 4, 20, 173, 2612, 66900, 2851540, 201613875
OFFSET
1,1
CROSSREFS
Sequence in context: A357671 A052573 A110371 * A061348 A127103 A059831
KEYWORD
hard,nonn
AUTHOR
Walter D Neumann (neumann(AT)math.columbia.edu), Jun 30 2006
STATUS
approved