|
Search: id:A003094
|
|
|
| A003094 |
|
Number of unlabeled connected planar simple graphs with n nodes.
(Formerly M1652)
|
|
+0
9
|
|
| 1, 1, 1, 2, 6, 20, 99, 646, 5974, 71885, 1052805, 17449299
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
P. Steinbach, Field Guide to Simple Graphs. Design Lab, Albuquerque NM, 1990.
R. J. Wilson, Introduction to Graph Theory. Academic Press, NY, 1972, p. 162.
|
|
LINKS
|
David Wasserman, Table of n, a(n) for n = 0..11
E. Friedman, Illustration of small graphs
N. J. A. Sloane, Transforms
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
EXAMPLE
|
a(3)=2 since the path o-o-o and the triangle are the two connected planar simple graphs on three nodes.
|
|
CROSSREFS
|
Inverse Euler transform of A005470 - Christian G. Bower (bowerc(AT)usa.net)
Cf. A126201.
Sequence in context: A020095 A026991 A049379 this_sequence A073964 A079457 A079455
Adjacent sequences: A003091 A003092 A003093 this_sequence A003095 A003096 A003097
|
|
KEYWORD
|
nonn,nice,hard,core
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Brendan McKay (bdm(AT)cs.anu.edu.au)
|
|
|
Search completed in 0.002 seconds
|
