[math-fun] poly-anygons; count of chess positions

[franktaw at netscape.net]

I would be quite surprised if this is in fact A001004, although it might possibly match for a few more terms. 
 
Franklin T. Adams-Watters
16 W. Michigan Ave.
Palatine, IL 60067
847-776-7645
 
 
-----Original Message-----
From: Richard Guy <rkg at cpsc.ucalgary.ca>
To: math-fun <math-fun at mailman.xmission.com>
Cc: Richard Schroeppel <rcs at cs.arizona.edu>; seqfan at ext.jussieu.fr
Sent: Tue, 18 Oct 2005 16:08:02 -0600 (MDT)
Subject: Re: [math-fun] poly-anygons; count of chess positions


This is evidently A001004 in OEIS. R. 
 
On Tue, 18 Oct 2005, Schroeppel, Richard wrote: 
 
> I decided to count polyanygons. 
> These are kind of like polyominos, except you can use 
> any regular polygons of side = 1, as long as there's no 
> overlapping. 
> 
> A regular polygon of N sides has a score of N-2: 
> triangles score 1, squares 2, etc. 
> The score for a polyanygon is the total of its components. 
> 
> My counts (by hand): 1 2 3 9 20 75. 
> ...
__________________________________________________________________
Look What The New Netscape.com Can Do!
Now you can preview dozens of stories and have the ones you select delivered to you without ever leaving the Top Home Page. And the new Tool Box gives you one click access to local Movie times, Maps, White Pages and more.  See for yourself at http://netcenter.netscape.com/netcenter/
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.seqfan.eu/pipermail/seqfan/attachments/20051019/e45e51ca/attachment-0001.htm>