|
Search: id:A126201
|
|
|
| A126201 |
|
Number of rooted connected unlabeled planar graphs on n nodes. |
|
+0
4
|
| |
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Number of "pointed" connected planar graphs on n nodes: number of pairs (G,P) where G is a connected unlabeled planar graph with n nodes and P runs through the orbit representatives of nodes in G under the action of Aut(G).
For n <= 4 this agrees with A126100; a(5) = A126100(5) - 1 = 57, since K_5 is the only excluded graph on 5 nodes.
|
|
CROSSREFS
|
Cf. A005470, A039735, A126100.
Sequence in context: A094611 A052442 A001586 this_sequence A020012 A126100 A009444
Adjacent sequences: A126198 A126199 A126200 this_sequence A126202 A126203 A126204
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
David Applegate (david(AT)research.att.com) and N. J. A. Sloane (njas(AT)research.att.com), Mar 09 2007
|
|
EXTENSIONS
|
a(6)-a(10) from Brendan McKay, Mar 10 2007
|
|
|
Search completed in 0.002 seconds
|
