The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A322742 Sorted list of 120 distinct triangle areas corresponding to the unique solution to the problem of placing 10 points on a grid rectangle of minimal area, such that all triangles formed by any 3 of the points have distinct areas > 0. 3
 1, 2, 3, 4, 7, 8, 9, 14, 15, 19, 20, 21, 23, 24, 26, 27, 28, 30, 31, 33, 34, 35, 36, 37, 39, 40, 42, 43, 45, 46, 47, 49, 50, 52, 53, 55, 56, 58, 59, 61, 65, 67, 68, 69, 70, 74, 75, 77, 78, 79, 80, 81, 84, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 100, 101, 106, 107, 111 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS The sequence gives the areas multiplied by 2. For more information see A322740. The coordinates of the 10 grid points on the minimal 19 X 18 rectangle are (0,3), (1,9), (2,18), (5,0), (5,10), (12,17), (15,13), (17,4), (18,0), (19,5). LINKS Hugo Pfoertner, Table of n, a(n) for n = 1..120 PROG (PARI)  X=[0, 1, 2, 5, 5, 12, 15, 17, 18, 19]; Y=[3, 9, 18, 0, 10, 17, 13, 4, 0, 5]; 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)) CROSSREFS Cf. A303331, A322740, A322741. Sequence in context: A319837 A321699 A050271 * A307561 A152037 A329295 Adjacent sequences:  A322739 A322740 A322741 * A322743 A322744 A322745 KEYWORD nonn,fini,full AUTHOR Hugo Pfoertner, Dec 24 2018 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 27 13:15 EDT 2020. Contains 334657 sequences. (Running on oeis4.)