Counting n-gons

[franktaw at netscape.net]

There's a problem with this formulation.  Triangles are determined up 
to congruence by their side lenths, but polygons with more sides are 
not.  (Consider rhombus vs. square.)

To make it work, you have to define it purely in terms of edge lengths: 
sequences of n positive integers, totalling p, whose largest value is 
less than the sum of the others (equivalently, less than p/2); up to 
equivalence under rotation and reflection.

Franklin T. Adams-Watters


-----Original Message-----
From: davidwwilson at comcast.net

Let f(n,p) be the number of non-congruent integer-sided n-gons with 
perimeter p. Then f(3,p) = A005044.
 
Can we come up with a general formula/recurrence for f(n, p)?


________________________________________________________________________
Check Out the new free AIM(R) Mail -- 2 GB of storage and 
industry-leading spam and email virus protection.