|
%I #29 Jun 14 2018 04:00:56
%S 1,1,3,5,11,19,43,75,155,287,567,1053,2063,3859,7455,14089,27083,
%T 51463,98855,188697,362675,695155,1338087,2573235,4962875,9571195,
%U 18496407,35759799,69240899,134154259,260235639,505163055,981575759,1908619755,3714304167,7233118641,14095779055
%N Number of integer-sided polygons having perimeter n, modulo rotations but not reflections.
%C Rotations are counted only once, but reflections are considered different. For a polygon to be nondegenerate, the longest side must be shorter than the sum of the remaining sides (equivalently, shorter than n/2). These are row sums of A293819.
%C A formula is given in Section 6 of the East and Niles article.
%C The same article shows that a(n) is asymptotic to 2^n / n.
%H Andrew Howroyd, <a href="/A293820/b293820.txt">Table of n, a(n) for n = 3..200</a>
%H James East, Ron Niles, <a href="https://arxiv.org/abs/1710.11245">Integer polygons of given perimeter</a>, arXiv:1710.11245 [math.CO], 2017.
%F a(n) = (Sum_{d|n} phi(n/d)*2^d)/n - 1 - 2^floor(n/2). - _Andrew Howroyd_, Nov 21 2017
%e There are 11 polygons having perimeter 7: 2 triangles (331, 322), 4 quadrilaterals (3211, 3121, 3112, 2221), 3 pentagons (31111, 22111, 21211), 1 hexagon (211111) and 1 heptagon (1111111).
%t T[n_, k_] := DivisorSum[GCD[n, k], EulerPhi[#]*Binomial[n/#, k/#] &]/n - Binomial[Floor[n/2], k - 1];
%t a[n_] := Sum[T[n, k], {k, 3, n}]
%t Table[a[n], {n, 3, 40}] (* _Jean-François Alcover_, Jun 14 2018, after _Andrew Howroyd_ *)
%o (PARI) a(n) = sumdiv(n, d, eulerphi(n/d)*2^d)/n - 1 - 2^floor(n/2); \\ _Andrew Howroyd_, Nov 21 2017
%Y Cf. A008742 (triangles), A293818 (reflections allowed), A293821 (quadrilaterals), A293822 (pentagons), A293823 (hexagons).
%Y Row sums of A293819 (k-gon triangle).
%K nonn
%O 3,3
%A _James East_, Oct 16 2017
|
