|
Search: id:A007145
|
|
|
| A007145 |
|
Number of rooted bridgeless graphs with n nodes.
(Formerly M3605)
|
|
+0
2
|
|
| 1, 0, 1, 4, 24, 193, 2420, 47912, 1600524, 93253226, 9694177479, 1822463625183, 625829508087155, 395785845695978077, 464137111800208818956, 1015091598240432264958267, 4160447480034069826186309689
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
P. Hanlon and R. W. Robinson, Counting bridgeless graphs, J. Combin. Theory, B 33 (1982), 276-305.
|
|
LINKS
|
R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 06 2007, Table of n, a(n) for n = 1..23
|
|
CROSSREFS
|
Cf. A007146.
Sequence in context: A002866 A073840 A024249 this_sequence A101370 A099021 A136229
Adjacent sequences: A007142 A007143 A007144 this_sequence A007146 A007147 A007148
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
Reference gives first 22 terms.
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 06 2007
|
|
|
Search completed in 0.002 seconds
|
