|
Search: id:A122082
|
|
|
| A122082 |
|
Number of unlabeled bicolored graphs on 2n nodes which are invariant when the two color classes are interchanged. |
|
+0
3
|
|
| 1, 2, 5, 16, 67, 404, 3904, 64840, 1930842, 104698904, 10401039400, 1900637187280, 641429385018832, 401454435464761376, 467919402404052870944, 1019758699013228238271040, 4171161230867751509749228304
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976.
|
|
FORMULA
|
a(n) = 2*A007139(n)-A002724(n). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Feb 27 2007
|
|
CROSSREFS
|
Sequence in context: A019504 A005163 A006116 this_sequence A002631 A107948 A058673
Adjacent sequences: A122079 A122080 A122081 this_sequence A122083 A122084 A122085
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, Oct 18 2006
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Feb 27 2007
|
|
|
Search completed in 0.002 seconds
|
