login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126201 Number of rooted connected unlabeled planar graphs on n nodes. 4
1, 1, 3, 11, 57, 375, 3398, 40043, 585440, 9895493 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

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.

LINKS

Table of n, a(n) for n=1..10.

CROSSREFS

Cf. A005470, A039735, A126100.

Sequence in context: A188458 A212435 A001586 * A261643 A229512 A208990

Adjacent sequences:  A126198 A126199 A126200 * A126202 A126203 A126204

KEYWORD

nonn,more

AUTHOR

David Applegate and N. J. A. Sloane, Mar 09 2007

EXTENSIONS

a(6)-a(10) from Brendan McKay, Mar 10 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified July 22 03:22 EDT 2017. Contains 289648 sequences.