missing sequence? number of embeddings of planar graphs

[N. J. A. Sloane]

side of the triangle or not:
         o
        / \
       o---o
      /     \
     o       o
Return-Path: <bdm at cs.anu.edu.au>
X-Ids: 164
Date: Sat, 10 Mar 2007 15:07:55 +1100
From: Brendan McKay <bdm at cs.anu.edu.au>
To: "N. J. A. Sloane" <njas at research.att.com>
Cc: seqfan at ext.jussieu.fr
Message-ID: <20070310040755.GA3883 at cs.anu.edu.au>
References: <200703100325.l2A3P45W1357309 at fry.research.att.com>
MIME-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Disposition: inline
In-Reply-To: <200703100325.l2A3P45W1357309 at fry.research.att.com>
User-Agent: Mutt/1.5.12-2006-07-14
X-SA-Exim-Connect-IP: 150.203.160.15
X-SA-Exim-Mail-From: bdm at cs.anu.edu.au
X-Spam-Checker-Version: SpamAssassin 3.1.7 (2006-10-05) on dcsmail
X-Spam-Level: 
X-Spam-Status: No, score=-2.6 required=5.0 tests=AWL,BAYES_00 autolearn=ham 
	version=3.1.7
Subject: Re: missing sequence? number of embeddings of planar graphs
X-SA-Exim-Version: 4.2 (built Thu, 03 Mar 2005 10:44:12 +0100)
X-SA-Exim-Scanned: Yes (on dcsmail)
X-PMX-Version: 5.3.1.294258, Antispam-Engine: 2.5.0.283055, Antispam-Data: 2007.3.9.195434 internal
X-Greylist: IP, sender and recipient auto-whitelisted, not delayed by milter-greylist-2.0.2 (shiva.jussieu.fr [134.157.0.164]); Sat, 10 Mar 2007 05:08:10 +0100 (CET)
X-Virus-Scanned: ClamAV 0.88.7/2796/Sat Mar 10 02:06:00 2007 on shiva.jussieu.fr
X-Virus-Status: Clean
X-j-chkmail-Score: MSGID : 45F22F26.000 on shiva.jussieu.fr : j-chkmail score : X : 0/50 0 0.501 -> 1
X-Miltered: at shiva.jussieu.fr with ID 45F22F26.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)!


I have #2 up to 14 vertices (3807081193879), computed by myself
and Gunnar Brinkmann.  Presumably #1 follows by the appropriate
transformation.

There are actually two natural variants, depending on whether
mirror images are counted as equivalent.

Looking at our paper, it seems like lots of things in there are not
in OEIS. Bad us. Would anyone like to volunteer to do the packaging
and transformations? I really don't have time. It would help to
be able to understand basic terminology for graphs and planar
embeddings. Expect a few hours of work. Of course I'll help to get
the definitions straight.

Brendan.

* N. J. A. Sloane <njas at research.att.com> [070310 14:25]:
> 
> Dear Seqfans,
> 
> I suspect these two sequences may be missing from the OEIS:
> 
> 1.  Number of planar graphs on n unlabeled nodes,
> where we count each graph according to the number
> of its embeddings into the sphere.
> 
> For example, this graph on 5 nodes has 2 embeddings,
> dpending on whether the two "whiskers" are on the same
> side of the triangle or not:
> 
>          o
>         / \
>        o---o
>       /     \
>      o       o
> 
> 2. Same question for connected planar graphs
> 
> Could someone work out the first few terms?
> 
> Neil
> 
> (Planar graphs are in A005470, connected ditto in A003094)
>