|
Search: id:A005470
|
|
|
| A005470 |
|
Number of unlabeled planar simple graphs with n nodes.
(Formerly M1252)
|
|
+0
25
|
|
| 1, 1, 2, 4, 11, 33, 142, 822, 6966, 79853, 1140916, 18681008
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Euler transform of A003094 - Christian G. Bower (bowerc(AT)usa.net)
|
|
REFERENCES
|
P. Steinbach, Field Guide to Simple Graphs. Design Lab, Albuquerque NM, 1990.
W. T. Trotter, ed., Planar Graphs, Vol. 9, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Amer. Math. Soc., 1993.
R. J. Wilson, Introduction to Graph Theory. Academic Press, NY, 1972, p. 162.
|
|
LINKS
|
David Wasserman, Table of n, a(n) for n = 1..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.
Index entries for "core" sequences
|
|
EXAMPLE
|
a(2)=2 since o o and o-o are the two planar simple graphs on two nodes.
|
|
CROSSREFS
|
Cf. A003094 (connected planar graphs), A034889, A039735 (planar graphs by nodes and edges).
Cf. A126201.
Sequence in context: A123469 A123448 A039707 this_sequence A123471 A123416 A123406
Adjacent sequences: A005467 A005468 A005469 this_sequence A005471 A005472 A005473
|
|
KEYWORD
|
nonn,core,nice,hard
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
n=8 term corrected and n=9..11 terms calculated by Brendan McKay (bdm(AT)cs.anu.edu.au)
Terms a(0) - a(10) confirmed by David Applegate (david(AT)research.att.com) and njas, Mar 09 2007
|
|
|
Search completed in 0.002 seconds
|
