Location via proxy:
[ UP ]
[Report a bug]
[Manage cookies]
No cookies
No scripts
No ads
No referrer
Show this form
login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The On-Line Encyclopedia of Integer Sequences
!)
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
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
1,1
LINKS
Table of n, a(n) for n=1..8.
J. Behrstock and W.D. Neumann,
Quasi-isometric classification of graph manifold groups
CROSSREFS
Sequence in context:
A357671
A052573
A110371
*
A061348
A127103
A059831
Adjacent sequences:
A120385
A120386
A120387
*
A120389
A120390
A120391
KEYWORD
hard
,
nonn
AUTHOR
Walter D Neumann (neumann(AT)math.columbia.edu), Jun 30 2006
STATUS
approved
Lookup
|
Welcome
|
Wiki
|
Register
|
Music
|
Plot 2
|
Demos
|
Index
|
Browse
|
More
|
WebCam
Contribute new seq. or comment
|
Format
|
Style Sheet
|
Transforms
|
Superseeker
|
Recents
The OEIS Community
| Maintained by
The OEIS Foundation Inc.
License Agreements, Terms of Use, Privacy Policy.
.
Last modified August 19 11:32 EDT 2024. Contains 375284 sequences. (Running on oeis4.)
