|
| |
|
|
A004100
|
|
Number of labeled nonseparable bipartite graphs on n nodes.
(Formerly M2878)
|
|
1
| |
|
|
0, 1, 0, 3, 10, 355, 6986, 297619, 15077658, 1120452771, 111765799882, 15350524923547, 2875055248515242, 738416821509929731, 260316039943139322858, 126430202628042630866787, 84814075550928212558332858, 78847417416749666369637926851
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,4
|
|
|
REFERENCES
| F. Harary and R. W. Robinson, Labeled bipartite blocks, Canad. J. Math., 31 (1979), 60-68.
A. Nymeyer and R. W. Robinson, ``Tabulation of the Numbers of Labeled Bipartite Blocks and Related Classes of Bicolored Graphs,'' unpublished manuscript, 1982.
R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
| R. W. Robinson, Table of n, a(n) for n = 1..32
|
|
|
CROSSREFS
| Sequence in context: A067999 A156193 A119035 * A103156 A202712 A006273
Adjacent sequences: A004097 A004098 A004099 * A004101 A004102 A004103
|
|
|
KEYWORD
| nonn,nice,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
EXTENSIONS
| a(16) onwards added by N. J. A. Sloane (njas(AT)research.att.com), Oct 19 2006 from the Robinson reference
|
| |
|
|
