|
Search: id:A007139
|
|
|
| A007139 |
|
Number of unlabeled bicolored graphs on 2n nodes having n nodes of each color and allowing the color classes to be interchanged.
(Formerly M4172)
|
|
+0
6
|
|
| 1, 2, 6, 26, 192, 3014, 127757, 16853750, 7343780765, 10733574184956, 52867617324773592, 882178116079222400788, 50227997322550920824045262, 9837048598740665027344331562224, 6681839615514161556535851222043192179
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
F. Harary, L. March and R. W. Robinson, On enumerating certain design problems in terms of bicolored graphs with no isolates, Environment and Planning, B 5 (1978), 31-43.
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976.
|
|
FORMULA
|
a(n) = (A002724(n)+A122082(n))/2. - Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 27 2007
|
|
CROSSREFS
|
Cf. A007140, A122081.
Sequence in context: A086584 A032014 A112948 this_sequence A162438 A137071 A034565
Adjacent sequences: A007136 A007137 A007138 this_sequence A007140 A007141 A007142
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 27 2007
Edited by N. J. A. Sloane (njas(AT)research.att.com), Aug 14 2007
|
|
|
Search completed in 0.002 seconds
|
