|
Search: id:A007146
|
|
|
| A007146 |
|
Number of bridgeless graphs with n nodes.
(Formerly M2909)
|
|
+0
2
|
|
| 1, 0, 1, 3, 11, 60, 502, 7403, 197442, 9804368, 902818087, 153721215608, 48443044675155, 28363687700395422, 30996524108446916915, 63502033750022111383196, 244852545022627009655180986
(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..22
|
|
CROSSREFS
|
Cf. A007145.
Sequence in context: A007807 A075201 A136440 this_sequence A076475 A125556 A127516
Adjacent sequences: A007143 A007144 A007145 this_sequence A007147 A007148 A007149
|
|
KEYWORD
|
nonn,nice,easy
|
|
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
|
