A293819 -id:A293819 - cp's OEIS frontend

A124287 Triangle of the number of integer-sided k-gons having perimeter n, for k=3..n.

1, 0, 1, 1, 1, 1, 1, 2, 1, 1, 2, 3, 3, 1, 1, 1, 5, 4, 4, 1, 1, 3, 7, 9, 7, 4, 1, 1, 2, 9, 13, 15, 8, 5, 1, 1, 4, 13, 23, 25, 20, 10, 5, 1, 1, 3, 16, 29, 46, 37, 29, 12, 6, 1, 1, 5, 22, 48, 72, 75, 57, 35, 14, 6, 1, 1, 4, 25, 60, 113, 129, 125, 79, 47, 16, 7, 1, 1, 7, 34, 92, 172, 228, 231, 185

Offset: 3

T. D. Noe, Oct 24 2006

Rotations and reversals are counted only once. For a k-gon to be nondegenerate, the longest side must be shorter than the sum of the remaining sides. Column k=3 is A005044, column k=4 is A057886, column k=5 is A124285 and column k=6 is A124286. Note that A124278 counts polygons whose sides are nondecreasing.

			For polygons having perimeter 7: 2 triangles, 3 quadrilaterals, 3 pentagons, 1 hexagon and 1 heptagon. The triangle begins
1
0 1
1 1 1
1 2 1 1
2 3 3 1 1
1 5 4 4 1 1

Andrew Howroyd, Table of n, a(n) for n = 3..1277 (terms 3..212 from T. D. Noe)
James East, Ron Niles, Integer polygons of given perimeter, arXiv:1710.11245 [math.CO], 2017.

Row sums are A293818.

Cf. A293819.

Needs["DiscreteMath`Combinatorica`"]; Table[p=Partitions[n]; Table[s=Select[p,Length[ # ]==k && #[[1]]Jean-François Alcover, Jun 14 2018, after Andrew Howroyd *)

T(n,k)={(sumdiv(gcd(n, k), d, eulerphi(d)*binomial(n/d, k/d))/n + binomial(k\2 + (n-k)\2, k\2) - binomial(n\2, k-1) - binomial(n\4, k\2) - if(k%2, 0, binomial((n+2)\4, k\2)))/2;}
for(n=3, 10, for(k=3, n, print1(T(n, k), ", ")); print); \\ Andrew Howroyd, Nov 21 2017

A formula is given in Theorem 1.5 of the East and Niles article.

A293820 Number of integer-sided polygons having perimeter n, modulo rotations but not reflections.

Original entry on oeis.org

1, 1, 3, 5, 11, 19, 43, 75, 155, 287, 567, 1053, 2063, 3859, 7455, 14089, 27083, 51463, 98855, 188697, 362675, 695155, 1338087, 2573235, 4962875, 9571195, 18496407, 35759799, 69240899, 134154259, 260235639, 505163055, 981575759, 1908619755, 3714304167, 7233118641, 14095779055

Offset: 3

James East, Oct 16 2017

nonn

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.
A formula is given in Section 6 of the East and Niles article.
The same article shows that a(n) is asymptotic to 2^n / n.

			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).

Andrew Howroyd, Table of n, a(n) for n = 3..200
James East, Ron Niles, Integer polygons of given perimeter, arXiv:1710.11245 [math.CO], 2017.

Cf. A008742 (triangles), A293818 (reflections allowed), A293821 (quadrilaterals), A293822 (pentagons), A293823 (hexagons).

Row sums of A293819 (k-gon triangle).

T[n_, k_] := DivisorSum[GCD[n, k], EulerPhi[#]*Binomial[n/#, k/#] &]/n - Binomial[Floor[n/2], k - 1];
a[n_] := Sum[T[n, k], {k, 3, n}]
Table[a[n], {n, 3, 40}] (* Jean-François Alcover, Jun 14 2018, after Andrew Howroyd *)

a(n) = sumdiv(n, d, eulerphi(n/d)*2^d)/n - 1 - 2^floor(n/2); \\ Andrew Howroyd, Nov 21 2017

a(n) = (Sum_{d|n} phi(n/d)*2^d)/n - 1 - 2^floor(n/2). - Andrew Howroyd, Nov 21 2017

A293822 Number of integer-sided pentagons having perimeter n, modulo rotations but not reflections.

Original entry on oeis.org

1, 1, 3, 6, 13, 21, 37, 51, 84, 108, 166, 203, 294, 350, 486, 566, 759, 867, 1133, 1276, 1631, 1815, 2275, 2509, 3094, 3386, 4116, 4473, 5372, 5804, 6896, 7412, 8721, 9333, 10887, 11606, 13433, 14269, 16401, 17367, 19836, 20944, 23782, 25047, 28290, 29726, 33410, 35030, 39195, 41015

Offset: 5

James East, Oct 16 2017

nonn

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).

A formula is given in Section 6 of the East and Niles article.

			For example, there are 6 rotation-classes of perimeter-8 pentagons: 32111, 31211, 31121, 31112, 22211, 22121.  Note that 32111 and 31112 are reflections of each other, but these are not rotationally equivalent.

James East, Ron Niles, Integer polygons of given perimeter, arXiv:1710.11245 [math.CO], 2017.

Column k=5 of A293819.

Cf. A293820 (polygons), A293821 (quadrilaterals), A293823 (hexagons).

T[n_, k_] := DivisorSum[GCD[n, k], EulerPhi[#]*Binomial[n/#, k/#] &]/n - Binomial[Floor[n/2], k - 1];
a[n_] := T[n, 5];
Table[a[n], {n, 5, 60}] (* Jean-François Alcover, Jun 14 2018, after Andrew Howroyd and A293819 *)

G.f.: x^5*(1 + x - x^2 + 2*x^3 + 7*x^4 + 2*x^5 - 2*x^6 + x^8) / ((1 - x)^5*(1 + x)^4*(1 + x + x^2 + x^3 + x^4)) (conjectured). - Colin Barker, Nov 01 2017

A008742 Molien series for 3-dimensional group [3,3 ]+ = 332.

Original entry on oeis.org

1, 0, 1, 1, 2, 1, 4, 2, 5, 4, 7, 5, 10, 7, 12, 10, 15, 12, 19, 15, 22, 19, 26, 22, 31, 26, 35, 31, 40, 35, 46, 40, 51, 46, 57, 51, 64, 57, 70, 64, 77, 70, 85, 77, 92, 85, 100, 92, 109, 100, 117, 109, 126, 117, 136

Offset: 0

N. J. A. Sloane

a(n) is also the number of integer-sided triangles having perimeter n + 3, modulo rotations but not reflections. - James East, Oct 16 2017

			For n = 6, there are 4 rotation-classes of perimeter-9 triangles: 441, 432, 423, 333. Note that 432 and 423 are reflections of each other, but these are not rotationally equivalent. So a(6) = 4. - _James East_, Oct 16 2017

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
James East and Ron Niles, Integer polygons with given perimeter, arXiv/1710.11245 [math.CO], 2017.
Index entries for Molien series
Index entries for linear recurrences with constant coefficients, signature (0,2,1,-1,-2,0,1).

Cf. A005044, A293819 (k-gon triangle), A293820 (polygons), A293821 (quadrilaterals), A293822 (pentagons), A293823 (hexagons)

a:=[1,0,1,1,2,1,4];; for n in [8..60] do a[n]:=2*a[n-2]+a[n-3]-a[n-4] -2*a[n-5]+a[n-7]; od; a; # G. C. Greubel, Aug 03 2019

R:=PowerSeriesRing(Integers(), 60); Coefficients(R!( (1+x^6)/((1-x^2)*(1-x^3)*(1-x^4)) )); // G. C. Greubel, Aug 03 2019

CoefficientList[Series[(1+x^6)/((1-x^2)*(1-x^3)*(1-x^4)), {x, 0, 60}], x] (* Vaclav Kotesovec, Apr 29 2014 *)

my(x='x+O('x^60)); Vec((1+x^6)/((1-x^2)*(1-x^3)*(1-x^4))) \\ G. C. Greubel, Aug 03 2019

((1+x^6)/((1-x^2)*(1-x^3)*(1-x^4))).series(x, 60).coefficients(x, sparse=False) # G. C. Greubel, Aug 03 2019

G.f.: (1+x^6)/((1-x^2)*(1-x^3)*(1-x^4)).
a(n) ~ 1/24*n^2. - Ralf Stephan, Apr 29 2014
a(n) = 1 - 19*n/24 - 5*n^2/24 + 4/3*floor(n/3) + (n/2+3/4)*floor(n/2) + 2/3*floor((n+1)/3). - Vaclav Kotesovec, Apr 29 2014
a(n) = floor((n^2+3*n+20)/24+(2*n+3)*(-1)^n/16). - Tani Akinari, Jun 20 2014
G.f.: (1-x^2+x^4)/((1+x+x^2)*(1+x)^2*(1-x)^3). - R. J. Mathar, Dec 18 2014

A293821 Number of integer-sided quadrilaterals having perimeter n, modulo rotations but not reflections.

Original entry on oeis.org

1, 1, 2, 4, 6, 10, 12, 20, 23, 35, 38, 56, 60, 84, 88, 120, 125, 165, 170, 220, 226, 286, 292, 364, 371, 455, 462, 560, 568, 680, 688, 816, 825, 969, 978, 1140, 1150, 1330, 1340, 1540, 1551, 1771, 1782, 2024, 2036, 2300, 2312, 2600, 2613, 2925, 2938, 3276, 3290, 3654, 3668, 4060

Offset: 4

James East, Oct 16 2017

nonn

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).

A formula is given in Section 6 of the East and Niles article.

			For example, there are 4 rotation-classes of perimeter-7 quadrilaterals: 3211, 3121, 3112, 2221. Note that 3211 and 3112 are reflections of each other, but these are not rotationally equivalent.

James East, Ron Niles, Integer polygons of given perimeter, arXiv:1710.11245 [math.CO], 2017.

Column k=4 of A293819.

Cf. A008742 (triangles), A293820 (polygons), A293822 (pentagons).

T[n_, k_] := DivisorSum[GCD[n, k], EulerPhi[#]*Binomial[n/#, k/#] &]/n - Binomial[Floor[n/2], k - 1];
a[n_] := T[n, 4];
Table[a[n], {n, 4, 59}] (* Jean-François Alcover, Jan 29 2019, after Andrew Howroyd in A293819 *)

Conjectures from Colin Barker, Nov 01 2017: (Start)
G.f.: x^3*(1 - x^2 + 2*x^3) / ((1 - x)^4*(1 + x)^3*(1 + x^2)).
a(n) = (1/96)*(-3*(-1 + (-1)^n + 4*i*(-i)^n - 4*i*i^n) + (7 - 15*(-1)^n)*n + 3*(-1 + (-1)^n)*n^2 + 2*n^3) where i=sqrt(-1).
(End)

A293823 Number of integer-sided hexagons having perimeter n, modulo rotations but not reflections.

Original entry on oeis.org

1, 1, 4, 10, 21, 41, 74, 126, 196, 314, 448, 672, 912, 1302, 1692, 2334, 2937, 3927, 4828, 6292, 7579, 9679, 11466, 14378, 16808, 20748, 23968, 29198, 33388, 40188, 45564, 54264, 61047, 72033, 80484, 94164, 104587, 121429, 134134, 154672, 170016, 194810, 213200, 242880, 264730, 300002

Offset: 6

James East, Oct 16 2017

nonn

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).

A formula is given in Section 6 of the East and Niles article.

			For example, there are 10 rotation-classes of perimeter-9 hexagons: 411111, 321111, 312111, 311211, 311121, 311112, 222111, 221211, 221121, 212121. Note that 321111 and 311112 are reflections of each other, but these are not rotationally equivalent.

James East, Ron Niles, Integer polygons of given perimeter, arXiv:1710.11245 [math.CO], 2017.

Column k=6 of A293819.

Cf. A293820 (polygons), A293822 (pentagons).

T[n_, k_] := DivisorSum[GCD[n, k], EulerPhi[#]*Binomial[n/#, k/#] &]/n - Binomial[Floor[n/2], k - 1];
a[n_] := T[n, 6];
Table[a[n], {n, 6, 51}] (* Jean-François Alcover, Jan 29 2019, after Andrew Howroyd in A293819 *)

G.f.: x^6*(1 + x + 5*x^3 + 10*x^4 + 7*x^5 + 3*x^6 + 6*x^7 + 4*x^8 + 2*x^9) / ((1 - x)^6*(1 + x)^5*(1 - x + x^2)*(1 + x + x^2)^2) (conjectured). - Colin Barker, Nov 01 2017

A342307 Table read by ascending antidiagonals: T(n, k) is the maximum number of quasi k-gons that are not k-gons in a finite projective plane of order n, with k >= 3.

Original entry on oeis.org

126, 936, 2520, 3780, 41184, 25200, 11160, 287280, 1029600, 151200, 27090, 1294560, 12927600, 18532800, 529200, 57456, 4442760, 90619200, 439538400, 259459200, 846720, 110376, 12640320, 444276000, 4893436800, 12307075200, 2905943040, 0, 196560, 31346784, 1706443200, 34653528000, 222651374400, 295369804800, 26153487360, 0

Offset: 2

Stefano Spezia, Mar 08 2021

			n\k |     3        4         5           6
----+-------------------------------------
  2 |   126     2520     25200      151200 ...
  3 |   936    41184   1029600    18532800 ...
  4 |  3780   287280  12927600   439538400 ...
  5 | 11160  1294560  90619200  4893436800 ...
...

Vladislav Taranchuk, On the number of k-gons in finite projective planes, (2020).

Cf. A000142, A000217, A000794, A001231, A124278, A124287, A293819.

T[n_,k_]:=k!Binomial[k-1,2]Binomial[n^2+n+1,k-1](n-1); Table[T[n-k+3,k],{n,2,9},{k,3,n+1}]//Flatten

T(n, k) = k!*binomial(k - 1, 2)*binomial(n^2 + n + 1, k - 1)*(n - 1).

cp's OEIS Frontend

A124287 Triangle of the number of integer-sided k-gons having perimeter n, for k=3..n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A293820 Number of integer-sided polygons having perimeter n, modulo rotations but not reflections.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A293822 Number of integer-sided pentagons having perimeter n, modulo rotations but not reflections.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A008742 Molien series for 3-dimensional group [3,3 ]+ = 332.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

GAP

Magma

Mathematica

PARI

Sage

Formula

A293821 Number of integer-sided quadrilaterals having perimeter n, modulo rotations but not reflections.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A293823 Number of integer-sided hexagons having perimeter n, modulo rotations but not reflections.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A342307 Table read by ascending antidiagonals: T(n, k) is the maximum number of quasi k-gons that are not k-gons in a finite projective plane of order n, with k >= 3.

Views

Author

Keywords

Examples

Links

Crossrefs