cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A322740 Least area of a grid rectangle from which n >= 3 grid points can be chosen such that the binomial(n,3) triangles formed by any 3 of the points have distinct areas > 0.

Original entry on oeis.org

1, 4, 15, 30, 65, 120, 198, 342
Offset: 3

Views

Author

Hugo Pfoertner, Dec 24 2018

Keywords

Comments

Finding configurations of 11 points that can placed on a rectangle with area a(11) <= 600 had been the topic of the October 2018 Ponder This Challenge, based on a suggestion by Bert Dobbelaere.
The solution with the least area found by Hermann Jurksch gives an upper bound of a(11) <= 528. a(12) <= 841 from private communication with H. Jurksch.

Examples

			a(3) = 1 (trivial).
a(4) = 4: Choosing (0,0),(0,2),(1,0),(2,1) gives 4 triangles with areas (1/2)*{1 2 3 4}.
a(5) = 15: Choosing (0,0),(0,1),(1,5),(2,0),(3,2) from a 3 X 5 rectangle gives 10 triangles with areas (1/2)*{1 2 3 4 5 7 9 10 11 13}.
a(6) = 30: (0,5),(1,0),(2,6),(3,0),(5,3),(5,4) is a solution on the 5 X 6 rectangle.
a(7) = 65: (0,3),(1,5),(7,0),(11,1),(11,5),(12,4),(13,2) is a solution on the 13 X 5 rectangle.
a(8) = 120: There are two minimal solutions, (0,12),(1,0),(2,15),(3,0),(6,1),(6,4),(7,7),(8,14) on the 8 X 15 rectangle giving 56 triangles with areas (1/2)*{1 2 3 4 5 6 8 9 11 12 14 15 17 18 20 21 22 23 24 26 27 28 29 30 31 33 34 35 37 38 39 40 42 43 46 47 48 49 54 61 62 63 64 67 69 71 74 76 79 80 83 89 91 98 100 102}, and (0,7),(0,9),(1,1),(5,1),(6,10),(8,0),(9,12),(10,3) on the 10 X 12 rectangle with triangle areas {2 3 4 8 9 10 11 12 13 16 17 18 19 20 21 23 24 25 26 28 29 32 34 36 37 38 39 40 41 42 43 44 46 47 49 50 51 53 54 55 56 59 62 66 68 71 74 75 79 83 84 85 86 87 103 105}.
a(9) = 198: The unique solution, up to rotation and reflection, is (0,3),(1,9),(2,0),(3,10),(4,11),(12,2),(17,11),(18,1),(18,4) on an 18 X 11 rectangle. The list of the 84 corresponding triangle areas is given in A322741.
a(10) = 342: The unique solution, up to rotation and reflection, is (0,3),(1,9),(2,18),(5,0),(5,10),(12,17),(15,13),(17,4),(18,0),(19,5) on a 19 X 18 rectangle. The list of the 120 corresponding triangle areas is given in A322742.
		

Crossrefs

A322741 Sorted list of 84 distinct triangle areas corresponding to the unique solution to the problem of placing 9 points on a grid rectangle of minimal area, such that all triangles formed by any 3 of the points have distinct areas > 0.

Original entry on oeis.org

1, 3, 4, 6, 8, 9, 11, 12, 13, 15, 16, 17, 18, 19, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 33, 34, 39, 42, 43, 44, 45, 46, 48, 49, 50, 51, 54, 56, 58, 59, 64, 66, 67, 70, 73, 80, 87, 91, 92, 94, 95, 98, 99, 100, 104, 106, 107, 110, 113, 114, 116, 117, 121, 123, 127, 130, 132, 134, 139, 140, 141, 143, 145, 146, 148, 152, 156, 159, 161, 162, 168, 174, 178
Offset: 1

Views

Author

Hugo Pfoertner, Dec 24 2018

Keywords

Comments

The sequence gives the areas multiplied by 2.
For more information see A322740.
The coordinates of the 9 grid points on the minimal 18 X 11 rectangle are (0,3), (1,9), (2,0), (3,10), (4,11), (12,2), (17,11), (18,1), (18,4).

Crossrefs

Programs

  • PARI
    X=[0,1,2,3,4,12,17,18,18];Y=[3,9,0,10,11,2,11,1,4];n=0;a=vector(binomial(#X, 3)); for(i=1, #X-2, for(j=i+1, #X-1, for(k=j+1, #X, a[n++]=X[i]*(Y[j]-Y[k])+X[j]*(Y[k]-Y[i])+X[k]*(Y[i]-Y[j]))))
    vecsort(abs(a))
Showing 1-2 of 2 results.